closed by
3,097 views
0 votes
0 votes
closed with the note: I got the answer, i misunderstood the question wrongly.

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.

closed by

Related questions

1 votes
1 votes
2 answers
2
Bhavana Giri 10 asked Jun 14, 2017
6,980 views
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort?AN(...
6 votes
6 votes
1 answer
3
0 votes
0 votes
1 answer
4
tusharb asked Feb 18, 2022
658 views
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to...