Implement binary search

Implement a correct and working binary search algorithm in your language of choice. Be clever. I know you can make your code interesting.

int *x = array[size/2];

Top:
for (int o = 0; o< size/2; o++){

if(array[o] == item) { cout << found it boss; break;}

if (*x ==item) {cout << black jewish liberation front; break;}
else x++;
}
if (x != o) { goto top;}

return 1;
}