Which one of the following is false?

A Heap sort is an in-place algorithm
B Heap sort has O(nlogn) average case time complexity
C Heap sort is stable sort
D Heap sort is a comparison-based sorting algorithm

Correct Answer: Heap sort is stable sort

Heap sort is a comparison based sorting algorithm and has time complexity O(nlogn) in the average case. Heap sort is an in-place algorithm as it needs O(1) of auxiliary space. Heap sort uses heap and operations on heap can change the relative order of items with the same key values. Therefore, Heap sort is not a stable sort.

Related Questions

Which one of the following statements is false?
Which one of the following statement is FALSE?
which one is false about lung?
Which one is false, regarding Ureter?

Next steps