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
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!