Which of the following scenarios would NOT be suitable for binary search?
Practice Questions
Q1
Which of the following scenarios would NOT be suitable for binary search?
Searching in a sorted array
Searching in a linked list
Searching in a sorted list
Searching in a sorted tree
Questions & Step-by-Step Solutions
Which of the following scenarios would NOT be suitable for binary search?
Step 1: Understand what binary search is. It is a method used to find an item in a sorted list by repeatedly dividing the search interval in half.
Step 2: Know that binary search requires direct access to elements in the list. This means you need to be able to quickly jump to the middle element.
Step 3: Identify the types of data structures. Arrays allow direct access to any element using an index, while linked lists do not.
Step 4: Realize that in a linked list, to find the middle element, you have to start from the beginning and go through each element one by one.
Step 5: Conclude that since binary search needs direct access to the middle element and linked lists do not provide this, binary search is not suitable for linked lists.
