1 2 3 4 5 6 7 8 9 10 11
int search(int object, int A[], int end) { int l = 0, r = end, c = r / 2; while(A[c] != object && l <= r) { if(object > A[c]) l = c + 1; else r = c - 1; c = (l + r) / 2; } if(A[c] == object) return c; else return -1; }