binary search code(C version)

Here we are going to demostrate how to implement binary search engine.

int binarySearch(int *a, int l, int h, int x)
{
int r;
do {
r = (int)(l+h)/2;
if (a[r] == x) return m;
if (a[r] < x)
l = r+1;
else h = r-1;
} while(l <= h);
return -1;