X interview question
Implement binary search.
Interview Answer
Anonymous
Apr 3, 2016
boolean search(int[] nums, int key) { int start = 0, end = nums.length -1; while(start <= end) { int mid = start + (end - start) / 2; if(key == nums[mid]) return true; else if(key < nums[mid]) end = mid - 1; else start = mid + 1; } return false; }