## Binary Search

### March 23, 2009

Children who are learning arithmetic sometimes play a number-guessing game: “I’m thinking of a number between 1 and 100. Can you guess it?” “Is the number less than 50?” “Yes.” “Is the number less than 25?” “No.” And so on, halving the interval at each step until only one number is left. This technique is known colloquially as the binary chop.

Your first task is to write a function that takes a target number and an array of numbers in non-decreasing order and returns either the position of the number in the array, or -1 to indicate the target number is not in the array. For instance, `bsearch(32, [13 19 24 29 32 37 43])`

should return 4, since 32 is the fourth element of the array (counting from zero).

Beware that this exercise is harder than it looks. Jon Bentley, in his book *Programming Pearls*, reports that 90% of professional programmers cannot write a proper implementation of binary search in two hours, and Donald Knuth, in the second volume of his book *The Art of Computer Programming*, reports that though the first binary search was published in 1946, the first bug-free binary search wasn’t published until 1962.

Thus, your second task is to write a suitable test program that shows the accuracy of your binary search function.

Pages: 1 2

Hm, it seems fairly trivial, but given the description I’m undoubtedly missing something. Anyway, here’s my attempt in Haskell:

Please be more specific: since the array is nondecreasing, there might be more than one element having the same value. Which index should the function return? Is the index of any element having the target value acceptable, or should it be the index of the first, or the last, or something else?

You may assume all elements of the array are distinct.

[…] terrestrial television programme services of Asia Television Limited (ATV) (Note 1). … Binary Search « Programming Praxis – programmingpraxis.wordpress.com 03/23/2009 Jon Bentley, in his book Programming Pearls, reports […]

Sorry long post as I included fairly exhaustive test conditions using schemeunit. There are several edge cases with a binary search so I thought I’d include tests for all the ones I thought of.

barryallison,

What test cases would you use to test the following algorithms

1.) insertion sort

2.) mergesort

3.) heapsort

4.) binary trees methods (e.g. insert, delete, etc.)

In Python,

my c solution

int binary_search(int arr[], int n, int key)

{

int left, right, mid;

left = 0;

right = n – 1;

while(right > left)

{

mid = (left + right)/2;

if(key arr[mid])

{

left = mid + 1;

}

else

return mid;

}

return -1;

}

[\sourcecode]

My c solution

ruby solution (http://codepad.org/jUgepFQa) Doesn’t exactly use the binary chop *shameface*

Another interesting binary search algorithm that creates the binary representation of the position at which the targeted value can be found:

https://github.com/ftt/programming-praxis/blob/master/20090323-binary-search/binary-search.py