ericygu / medianofmedians Goto Github PK
View Code? Open in Web Editor NEWImplemented Quickselect with Median of Medians running in O(n) time in the worst case, optimized from a method like Collections.sort on the large array of size n/5, since the runtime of that algorithm is Ω(n log n) in the worst case.