*O solutie isteata* folosita de membrii infoarena utilizeaza puterile lui 2.
== code(c) |

int binary_search(int A, int x) {

int binary_search(int[] A, int x) {

  int i, step, N = A.length;
  for (step = 1; step < N; step <<= 1);
  for (i = 0; step; step >>= 1)

Sa vedem cum arata codul:
== code(c) |

int search(int[] A, int x) {

int binary_search(int[] A, int x) {

    int hi = A.length, lo = -1, mid;
    while (hi - lo > 1) {
      mid = (lo + hi) / 2;
      if (A[mid] < x)

        low = mid;

        lo = mid;

       else
         hi = mid;
    }