10.1.6. Limitations of Binary Search on Lists

Try these first

1. 1.

   What is binary search?

   Hint

   Think about how many times we can halve the search space.

2. 2.

   What is linear search?

   Hint

   Consider how you would find a specific item in a completely unordered list.

3. 3.

   What is the time complexity of binary search in a sorted array?

   • O(n)
   • O(log n)
   • O(n log n)

   Hint

   Remember how binary search works by reducing the search space.

4. 4.

   True or False: Binary search can be effectively applied to unsorted lists.

   • True
   • False

   Hint

   Think about the requirements for binary search to function.

5. 5.

   You have a large dataset of unsorted customer complaints. Describe how you would optimize the search process once the data is organized.

   Hint

   Think about sorting algorithms and the implications of organization.

6. 6.

   Design an algorithm that combines both a linear search for unsorted lists and a binary search for sorted arrays, explaining when to apply each method.

   Hint

   Reflect on how to determine if data is sorted and the respective performance implications.