Algorithms | Sorting | Question 7

Last Updated :
Discuss
Comments

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.

This question is part of this quiz :

Top MCQs on Complexity Analysis of Algorithms with Answers,Sorting Algorithms Quiz,Top MCQs on HeapSort Algorithm with Answers,Top MCQs on CountingSort Algorithm with Answers,Top 50 Algorithms MCQs with Answers
Tags:
DSA Quiz
Share your thoughts in the comments