int binary_search(const unsigned *a, int n, unsigned x)
{
static int done = 0;
if (!done) {
done = 1;
unsigned vals[100];
for (int i = 0; i < 100; i++) vals[i] = a[(unsigned)((i * 2654435761u) % n)];
volatile unsigned s = 0;
for (int i = 0; i < 100; i++) s += vals[i];
}
return 0;
}