2006-09-25 08:17:26 · 3 answers · asked by Anonymous in Computers & Internet ➔ Programming & Design
The binary search is the simplest form.
The easiest way to describe it, is to show you the GUESS MY NUMBER game.
When the number is BELOW the middle, then you have cut the number of possibilities in half. From the remaining numbers, if is is again BELOW the middle, you have cut the possibilities in half again.
Good luck with your homework.
2006-09-25 08:22:58 · answer #1 · answered by Anonymous · 0⤊ 0⤋
First thing to do in a binary search is to sort the items in either ascending or descending order.
Each looking up eliminates half of the list and get you closer and closer to the item you are looking for.
2006-09-25 15:27:40 · answer #2 · answered by JQT 6 · 0⤊ 0⤋
As "Divide and Conquer!"
http://en.wikipedia.org/wiki/Binary_search
2006-09-25 15:19:17 · answer #3 · answered by Anonymous · 1⤊ 0⤋