Pagini recente » Cod sursa (job #1616302) | Cod sursa (job #2897639) | Cod sursa (job #221784) | Cod sursa (job #73069) | Cod sursa (job #1506664)
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define Nadejde 10000000
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) {
FILE *in = fopen("algsort.in", "r");
FILE *out = fopen("algsort.out", "w");
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;
}