4 ms·You can always pick median element in O(n) time and it makes quicksort's worst case be O(nlogn)by IsTom 12y agoYou can always pick median element in O(n) time and it makes quicksort's worst case be O(nlogn)