problem_271.js

// This problem was asked by Netflix.

// Given a sorted list of integers of length N, determine if an element x is in the list without performing any multiplication, division, or bit-shift operations.

// Do this in O(log N) time.