Median Medians vs TreeMap

Question

I was wondering if using TreeMapthe array of numbers to get through and getting a sorted result is better than using the Median of Medians algorithm to find the Kth largest element in an unsorted array? Do they work in linear time?

Answer 1

Do they work in linear time?

Of course, they are: when the data is on the tree map, the search for K-order statistics is an O (N) ^* operation . Moreover, the likelihood that the operating system TreeMapwill have a lower constant coefficient if you do not decide to write a sorted container to an array.

, TreeMap - O (N * log ₂ N), Median of Medians , . TreeMap .

^* O (log ₂ N), .