10.1.1. Unsorted Case

Try these first

1. 1.

   What is the worst-case time complexity of linear search in an unsorted array?

   Hint

   Consider how many elements are potentially checked.

2. 2.

   In a sorted array, which search algorithm is more efficient?

   Hint

   Think about how elements are arranged.

3. 3.

   What is the main method used for searching in an unsorted array?

   • Binary Search
   • Linear Search
   • Jump Search

   Hint

   Think about searching through each item one by one.

4. 4.

   True or False: Binary search works best on unordered data.

   • True
   • False

   Hint

   Consider the importance of order in binary search.

5. 5.

   Given a dataset of 10,000 random integers, outline the process you'd use to find a specific number, detailing which search method you would use and why.

   Hint

   Think about efficiency in your search method!

6. 6.

   Take a sorted array of 32 elements. Calculate the maximum number of comparisons needed to find an element using binary search.

   Hint

   Reflect on the logarithmic nature of binary search.