binarySearch.c

int binarySearch(int  vector[], int n, int data)
{
   int center;
   int inf = 0;
   int sup = n - 1;
 
   while(inf <= sup){
     center = (sup + inf) / 2;

     if(vector[centro] == data) {
         return centro;
     } else if (data < vector[centro] ) {
	sup = center - 1;
     } else {
        inf = center + 1;
     }
   }
   return -1;
}