Algorithms Homework – Fall 2000

return. c. The size of the array is continually divided in half until the element is found or determined not to exist in the array. This determination will occur by the time the array is of size 1. The array can only be divided in half down to size 1 lg n times, and each time 1 compare is done. ................
................