10.1.2. Worst-Case Scenario

Try these first

1. 1.

   What is the time complexity of linear search?

   Hint

   Think about how many elements you might have to check.

2. 2.

   Can binary search be applied to unsorted arrays?

   Hint

   Recall the precondition for binary search.

3. 3.

   What is the time complexity of a linear search algorithm?

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

   Hint

   Think about worst-case scenarios in the search process.

4. 4.

   True or False: Binary search can be performed on an unsorted array.

   • True
   • False

   Hint

   Review the requirements for employing binary search.

5. 5.

   Consider an array of size n. You implement linear search, and then you change the array to be sorted. How would you expect the average search time to change, and why?

   Hint

   Compare efficiency based on array structure.

6. 6.

   If the input size doubles, how does that impact the time complexity for linear versus binary search?

   Hint

   Chart how inputs affect search times differently.