Which of the following is not true about comparison based sorting algorithms?

YasminRadwan26

Save to bookmark

2022-05-29

418

The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array
Heap Sort is not a comparison based sorting algorithm
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 algortihm

Algorithms, MCQ Questions, Algorithms MCQ-questions,

YasminRadwan26

2022-05-29

need an explanation for this answer? contact us directly to get an explanation for this answer

Correct Answer:

Heap Sort is not a comparison based sorting algorithm

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)