Top

Discussion

Array is preferred over linked list for the implementation of ________

  • A.Radix sort
  • B.Insertion sort
  • C.Binary search
  • D.Polynomial evaluation

Answer: C

When we try to implement binary search using linked list, the traversal steps per element increases in order to find the middle element. Thus, this process is slow and inefficient. This process is much faster using an array, hence it is preferable to use an array for the implementation of binary search.

No comment is present. Be the first to comment.
Loading…

Post your comment