Open In App

Algorithms | Sorting | Question 7

Like Article
Like
Save Article
Save
Share
Report issue
Report

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:

Heap Sort is not a comparison based sorting algorithm is not correct.


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


Last Updated : 06 Sep, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads