
Description
This applet demonstrates the binary search algorithm using a simple array.
The algorithm takes O(log n) time in the worst case.
Code
(Binary search on a simple array)
boolean binarySearch(int key){ int first,last,mid = 0; boolean found = false; first=0; last=size1; while((!found) && (first <= last)){ mid=first+(lastfirst)/2; if(arr[mid]==key) found=true; else if(key < arr[mid]) last=mid1; else if(key > arr[mid]) first=mid+1; } return found; } 