02/21/00
COM1100 Winter2000 Yuhong Yin
9
Binary
search algorithm
// function prototype
int binarySearch(int list[], int size, int key);
// function definition
// this function returns the location of key in the list
// -1 is returned if the value is not found
int binarySearch(int list[], int size, int key) {
int left,
right, middle;
left =
0;
right = size
-1;
(refer to next slide)