Skip to content
Related Articles
Open in App
Not now

Related Articles

Algorithms | Sorting | Question 7

Improve Article
Save Article
  • Last Updated : 06 Sep, 2021
Improve Article
Save Article

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


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


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


Counting Sort is not a comparison based sorting algorithm


Heap Sort is not a comparison based sorting algorithm.

Answer: (D)


For point ‘a’ please visit 
For point ‘b’ please visit
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
Related Articles

Start Your Coding Journey Now!