Home Questions Search Forum Contact Guest Book Polls! Got a Question?
PREV Programs NEXT   (60 / 301)     Write C code to implement the Binary Search algorithm. Here is a C function int binarySearch(int arr[],int size, int item) {    int left, right, middle;    left  = 0;    right = size-1;    while(left<=right)    {       middle = ((left + right)/2);       if(item == arr[middle])       {         return(middle);       }              if(item > arr[middle])       {         left  = middle+1;       }       else       {         right = middle-1;       }    }    return(-1); } Note that the Binary Search algorithm has a prerequisite that the array passed to it must be already sorted in ascending order. This will not work on an unsorted array. The complexity of this algorithm is O(log(n)). PREV COMMENTS                                  INDEX                                  PRINT NEXT Last updated: November 3, 2005 www.cracktheinterview.com - Your destination for the most common IT interview questions, answers, frequently asked interview questions (FAQ), C Programs, C Datastructures for technical interviews conducted by the top IT companies around the world!