PA of Algorithms Q22

0. Which of the following statements is true?
I. As the number of entries in a hash table increases, the number of collisions increases.
II. Recursive programs are efficient
III. The worst case complexity for Quicksort is O(n² )
IV. Binary search using a linear linked list is efficient.

Answer
Comment
Array

Option : D
Explanation :
I). true
II). false, because recursive programs are use stack
III). true , best and avg O(nlog₂n) and worst O(n²)
IV). false, because binary search default find mid element O(log₂n) when use linear linked list find mid element O(n)

Forgot your password?

I agree with the Terms.