Question

The time complexity of a quick sort algorithm which makes use of median, found by an O(n) algorithm, as pivot element is:

Answer 1

Answer:

The worst case time complexity of a typical implementation of QuickSort is O(n2). ... The idea is bas. ed on the fact that the median element of an unsorted array can be found in linear time. So we