extern int find(int a[], int e, int n)
find()?
extern bool in_half(int a[], int left, int right, int e))
int find(int a[], int x, int n)
left = 0
right = n
while left < right
mid = (left + right)/2
if in_half(a, left, mid, x)
right = mid
else
left = mid
return a[left] == e ? left : -1
in_half()?
| ceiling((42 - 30)/5) | = ceiling(12/5) |
| = ceiling(2.2) | |
| = 3 |
find()?
in_half()?
int find(int a[], int e, int n) {
// Return the index of the element e
// in a[0..n-1], or return -1 if e
// isn't in a[0..n-1].
int find(int a[], int e, int n) {
// Look for e in a.
int find(int a[], int e, int n) {
This page last modified on 4 September 2003.