Binary search (cont.)
nprivate
int itemIndex
(Student item,
StudentList list) {
n int low; //lowest index
considered
n int high; //highest index
considered
int mid; //middle between high and
low
n low =0
n high = list.size() -1;
while (low <= high) {
n mid = (low+high)/2;
if (list.get(mid).lessThan(item))
low = mid+1;
n else
high =
mid-1;
}
n return low;
}