#include #include #include #include "../clock.h" typedef int data; typedef unsigned index; /* from Rosetta code */ int my_bsearch (data *a, index n, data x) { index i = 0, j = n - 1; while (i <= j) { index k = (i + j) / 2; if (a[k] == x) { return k; } else if (a[k] < x) { i = k + 1; } else { j = k - 1; } } return -1; } int my_bsearch2 (data *a, index n, data x) { index i = 0, j = n - 1; while (i <= j) { index k = (i + j) / 2; index kp1 = k+1, km1 = k-1; data ak = a[k]; i = ak < x ? kp1 : i; j = ak > x ? km1 : j; if (ak == x) { return k; } } return -1; } int my_bsearch3 (data *a, index n, data x) { index i = 0, j = n - 1; while (i <= j) { index k = (i + j) / 2; index kp1 = k+1, km1 = k-1; data ak = a[k]; _Bool lt = ak < x, gt = ak > x; i = lt ? kp1 : i; j = gt ? km1 : j; if (ak == x) { return k; } } return -1; } int my_bsearch4 (data *a, index n, data x) { index i = 0, j = n - 1, k; k = (i + j) / 2; while (i <= j) { index kp1 = k+1, km1 = k-1; data ak = a[k]; _Bool lt = ak < x, gt = ak > x; i = lt ? kp1 : i; j = gt ? km1 : j; if (ak == x) { goto end; } k = (i + j) / 2; } k=-1; end: return k; } void random_ascending_fill(data *a, index n) { unsigned r = 41; data v = 0; for(index i=0; i