Divide Conquer /
Binary Search
»
We recursively determing which half the item is in.
Binary search works only for ordered lists.
A binary search on 100 items takes only 7 steps.
We compare the needle with the haystack's middle item.
How do you find an item using binary search?
What type of list works when using binary search?
How many step takes a binary search in 100 items?
How binary search works?