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(nLogn) 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 algortihm

**(D)** Heap Sort is not a comparison based sorting algorithm.

**Answer:** **(D)** **Explanation:** See https://www.geeksforgeeks.org/lower-bound-on-comparison-based-sorting-algorithms/ for point A. See https://www.geeksforgeeks.org/stability-in-sorting-algorithms/ for B. C is true, count sort is an Integer Sorting algorithm.

Quiz of this Question

Data Structures and Algorithms – Self Paced Course

View Details