sparknotes

Binary Search

< Previous Section
What is Binary Search

Next Section >
Binary Search as Applied to Arrays

Problems

Problem : What are the best, worst, and average case times of binary search?

Problem : If there are 22,049 data elements being searched, what is the maximum number of "looks" it will take with binary search to find the data element being search for?

Solution for Problem 2 >>

Problem : Will binary search always be faster than linear search, even on a large data set?

Solution for Problem 3 >>

Problem : Why won't binary search work on linked lists?

Solution for Problem 4 >>

Problem : Sorting of a data set can be done in $O(n log n)$ time. You have in front of you a large data set that is in unsorted order. You need to complete $n$ searches on this data set. Does it make more sense to use linear search, or to sort it and use binary search.

Solution for Problem 5 >>

< Previous Section
What is Binary Search

Next Section >
Binary Search as Applied to Arrays