Algorithms | Sorting | Question 7
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.
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
Please Login to comment...