Which of the following is not true about comparison based sorting algorithms?
A)
Counting Sort is not a comparison based sorting algorithm
B)
The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array
C)
Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
D)
Heap Sort is not a comparison based sorting algorithm.
Which of the following is not true about comparison based sorting algorithms?
Answer: D) Heap Sort is not a comparison based sorting algorithm.
Explanation: Heap Sort is indeed a comparison-based sorting algorithm. It uses a binary heap data structure to create a partially ordered binary tree, and the comparison of elements during heapification and sorting is a fundamental part of its operation. The correct option would be:
D) Heap Sort is not a comparison based sorting algorithm.