Question

Array is preferred over linked list for the implementation of ________

(a) Radix sort

(b) Insertion sort

(c) Binary search

(d) Polynomial evaluation

The question was posed to me in an online quiz.

My question is based upon Static vs Dynamic Memory Allocation in chapter Dynamic Memory Allocation in C of C

Answer 1

The correct answer is (c) Binary search

The explanation is: 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.