Algorithms | Sorting | Question 7

Which of the following is not true about comparison-based sorting algorithms?

(A)

The minimum possible time complexity of a comparison-based sorting algorithm is O(n(log(n)) for a random input array

(B)

Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared

(C)

Counting Sort is not a comparison based sorting algorithm

(D)

Heap Sort is not a comparison based sorting algorithm.

Answer: (D)

Explanation:

For point ‘a’ please visit http://www.geeksforgeeks.org/lower-bound-on-comparison-based-sorting-algorithms/
For point ‘b’ please visit http://www.geeksforgeeks.org/stability-in-sorting-algorithms/.
Point C is true, count sort is an Integer Sorting algorithm.

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save