Cod sursa(job #662266)
Utilizator | Data | 16 ianuarie 2012 12:13:58 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.22 kb |
int binary_search(int[] A, int x) {
int hi = A.lenght, lo = -1, mid;
while (hi - lo >1) {
mid = (lo + hi) / 2;
if(A[mid] < x)
lo = mid;
else
hi = mid;
}
if (hi == a.lenght || A[hi] != x)
return -1;
else
return hi;
}