easy5 pts · first answer countssorting-and-searching

Quick sort worst-case time

What is the worst-case time complexity of quick sort, and when does it happen with a naive pivot choice?

A.O(n log n), when the array has many duplicatesB.O(n^2), only when the array has an odd lengthC.O(n log n), when the pivot is always the medianD.O(n^2), when every pivot is the min or max

Discussion 0

Join free to post in the discussion.

Quick sort worst-case time

Discussion 0

Related questions