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.
According to geeks for geeks the answer is (D). But everywhere i saw that the counting sort is not a comparision based sorting algorithm.
As per Wikipedia: Counting sort uses key values as indexes into an array, it is not a comparison sort
Sumit Singh Chauhan you are right Counting sort uses key values as indexes into an array, it is not a comparison sort , In above question Which of the following is not true about comparison based sorting algorithms? so, option c is true, answer should be D
it happens, By the way when i show this question, i thought you are asking about option A
have you got option A right
can you please help me with this.