c

/*binsearch: ecuentra x en v [0] <= v[1] <= ... <= v[n-1]*/  2  3 int binsearch(int x, int v[], int n)  4 {  5     int low,high,mid;  6  7     low = 0;  8     high = n-1;  9     while (low <= high){ 10         mid = (low + high)/2; 11         if (x < v[mid]) 12             high = mid-1; 13         else if (x > v[mid]) 14             low = mid + 1; 15         else /* el elemento fue encontrado*/ 16             return mid; 17             } 18             return -1; /*no se encontreo*/ 19             }