Question discussion

Which standard comparison-based sorting algorithm has the best average-case time complexity but the worst worst-case time complexity?

576Medium DSSSB TGT Computer Science 0 replies 1 views

0

Which standard comparison-based sorting algorithm has the best average-case time complexity but the worst worst-case time complexity?

AMerge Sort
BHeap Sort
CQuick Sort
DInsertion Sort

Correct answer: C

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!