1. Which of the following cannot be implemented efficiently in Linear Linked List

1. Quicksort
2. Radix Sort
3. Polynomials
4. Insertion Sort
5. Binary Search

• binary search....
  
• 11 years agoHelpfull: Yes(13) No(2)
• binary search ,because for binary search you need to randomly access any index but that is not possible in linked list because memory access is sequential
• 4 years agoHelpfull: Yes(2) No(0)
• quicksort
  because we need to choose a random pivot(randomization) for best outcomes of qs. but we can choose any node in ll randomly n efficiently as we can do in array or contiguous memory allocation.so this might give the the complexity n^2.in worst case than expected(nlogn).
  
  is it correct?
• 11 years agoHelpfull: Yes(1) No(11)
• Radix Sort
• 9 years agoHelpfull: Yes(1) No(0)
• Binary search
• 11 years agoHelpfull: Yes(0) No(1)
• radix sort
• 9 years agoHelpfull: Yes(0) No(0)