Binary Search

search(int a[], int lb, int ub, int x){

int m;

if (lb > ub) return -1;

m = (lb+ub)/2;

if (x==a[m]) return m;

else if (x<a[m]) return search(a,lb,m-1,x);

else return search(a,m+1,ub,x);

}