Search Algorithm

Aeolus | 13:34 Sat 25th Nov 2006 | Science

2 Answers

There is an algorithm for finding the correct place in an indexed set by repeatedly dividing the set in half and discarding the half that does not contain the required item.

Does anyone know what this algorithm is called and who developed it?

science

Chemical process involved in setting plaster/resin

Answers

1 to 2 of 2

Best Answer

No best answer has yet been selected by Aeolus. Once a best answer has been selected, it will be shown here.

For more on marking an answer as the "Best Answer", please visit our FAQ.

THECORBYLOON

It's called a binary search or binary chop algorithm so that may help wi yir search.

Aeolus

Question Author

Thank you THEC....

I must have googled every other 'search' combination; never thought of binary though it's obvious when you see it. Chop never even came into the equation, if you'll pardon the pun.

Got just what I needed from Wiki'ing 'binary search'; thanks again.

1 to 2 of 2

Do you know the answer?