Binary search

12 questions

1. What is the main difference between an ordered and unordered list?
2. Which of these is an advantage of an ordered list?
3. When searching for a word in a dictionary, what makes it possible to find the word?
4. Why might searching an unordered list take longer than an ordered list?
5. Which of these is an example of an ordered list?
6. What is the name of the algorithm that checks each item in a list one at a time to find a specific item?
7. What is the name of the algorithm that searches a sorted list by repeatedly halving the data set?
8. Match the term to its definition:
9. What type of list is required for a binary search to work?
10. What happens if the data is unordered and you want to perform a binary search?
11. Arrange the steps of a binary search algorithm in the correct order:
12. Why is binary search typically faster than linear search for large data sets?

License: OGL