1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
| #ifndef ALGORITHM_BINARY_SEARCH_METHOD_H
#define ALGORITHM_BINARY_SEARCH_METHOD_H
int binary_search (int list[], int list_size, int x) {
int left, right, mid;
left = 0;
right = list_size - 1;
while (left <= right) {
mid = (left + right)/2;
if (list[mid] == x) { return mid; }
else if (list[mid] < x) { left = mid + 1; }
else { right = mid - 1; }
}
return -1;
}
#endif
|
