Re:Proving that Android’s, Java’s and Python’s sorting algor...
by IsTom on Tuesday February 24, 2015 @01:37PM
(#9102576)
You can always pick median element in O(n) time and it makes quicksort's worst case be O(nlogn)
[ Parent
| on HN ]
There are no comments on this comment yet.