Median Quicksort

Computer Science Level pending

Suppose we have an \(O(n)\) algorithm that finds the median of an unsorted array of numbers. If we use the median as a pivot in a Quicksort implementation, what will be the worst case time complexity of the modified algorithm?

×

Problem Loading...

Note Loading...

Set Loading...