Question 1
Question 2
Question 3
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.
There are 3 questions to complete.