سورس جستجوی دودویی (Binary Search) با جاوا (Java)

public void binarySearch(int[] array, int search) {
    int first,last,middle;
    first  = 0;
    last   = n - 1;
    middle = (first + last)/2;
    while( first <= last ) {
        if ( array[middle] < search ) {
            first = middle + 1;
        } else if ( array[middle] == search ) {
            System.out.println(search + " found at location " + (middle + 1) + ".");
            break;
        } else {
            last = middle - 1;
        }
        middle = (first + last)/2;
    }
    if ( first > last ) {
        System.out.println(search + " is not present in the list.n");
    }
}