Output is 1 and time complexity is Linear in size of the list.
Why this ans is correct?? Binary Search takes only Logarithmic time
Algortihm STL MCQ
Hello @ashwani225,
You cannot perform binary search on a singly linked list as you cannot go back and forth, you can only move in one direction.
Hence linear search will be performed which has o(n) time complexity.
Hope, this would help.
Give a like if you are satisfied.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.