Cod sursa(job #662252)
Utilizator | Data | 16 ianuarie 2012 11:43:23 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.2 kb |
int binary_search(int[] A, int x) {
int i, step, N = A.lenght;
for(step = 1; step < N; step <<= 1);
for (i = 0; step >>= 1)
if(i + step < N && A[i + step] <= x)
i += step;
return i;
else
return -1
}