Linked lists are not suitable data structures for which one of the following problems?
Linked lists are suitable for:
Insertion sort: No need to swap here just find appropriate place and join the link
Polynomial manipulation: Linked List is a natural solution for polynomial manipulation
Radix sort: Here we are putting digits according to same position(unit,tens) into buckets; which can be effectively handled by linked lists.
Not Suitable for:
Binary search: Because finding mid element itself takes $O(n)$ time.
So, Option B is answer.
the answer is B.
The binary search algorithm is based on the logic of reducing your input size by half in every step until your search succeeds or input gets exhausted. The important point here is "the step to reduce input size should take constant time". In a case of an array, it's always a simple comparison based on array indexes that take O(1) time.
But in a case of Linked list, you don't have indexes to access items. To perform any operation on a list item, you first have to reach it by traversing all items before it. So to divide list by half you first have to reach the middle of the list then perform a comparison. Getting to the middle of the list takes O(n/2)[you have to traverse half of the list items] and comparison takes O(1).
Total = O(n/2) + O(1) = O(n/2)
So the input reduction step does not take constant time. It depends on list size. hence violates the essential requirement of Binary search.
I just share my pain...