Question: Why isn't it a good idea to use binary search to find a value in a sorted linked list of values? Why isn't it a
Why isn't it a good idea to use binary search to find a value in a sorted linked list of values?
Why isn't it a good idea to use binary search to find a value in a sorted linked list of values?
Binary search has a time complexity of Olog N which is not efficient for linked lists
Binary search relies on being able to access the kth item in a sequence of values, which is not available in a linked list
Binary search cannot be implemented recursively on a linked list
Binary search compares elements directly, which is not possible in a linked list
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
