10.1.3. Sorted Case and Binary Search

Try these first

1. 1.

   What is the time complexity of a linear search?

   Hint

   Think about how many elements you check in the worst case.

2. 2.

   Is binary search applicable to unsorted arrays?

   Hint

   Consider how binary search works—what does it rely on?

3. 3.

   Which search algorithm is more efficient for sorted arrays?

   • Linear Search
   • Binary Search
   • Both are Same

   Hint

   Which method halves the search space with each comparison?

4. 4.

   True or False: Linear search can find elements faster than binary search in a sorted array.

   • True
   • False

   Hint

   Consider how many elements each method has to check.

5. 5.

   Given a sorted array of integers, write pseudocode for a binary search implementation, ensuring to note how you would handle edge cases.

   Hint

   Consider what conditions you need to stop searching.

6. 6.

   Design a search algorithm suitable for both sorted and unsorted arrays. Discuss its complexities.

   Hint

   What are the characteristics that distinguish sorted from unsorted?