Cod sursa(job #1506661)
| Utilizator | Data | 20 octombrie 2015 21:06:28 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#define Nadejde 1000000
int a[Nadejde];
long long int start;
void bSearch(int lo, int hi, int val) {
while (hi - lo > 1) {
int mid = (lo + hi) >> 1;
if (a[mid] < val) {
lo = mid;
} else {
hi = mid;
}
}
}
int main(void) {
srand(time(NULL));
int i, N = Nadejde;
for (i = 0; i < N; i++) {
a[i] = (i << 1);
}
bSearch(-1, N, 1);
//randSearch(-1, N, 1);
/// Multumim Doamne!
puts("Doamne ajuta!");
return 0;
}
