| http://www.w3.org/ns/prov#value | - There is a hybrid, Introselect, based on David Musser???s Introsort, which gives better performance than QuickSelect if the data is ordered, but it???s unclear to me whether it would perform better than HeapSelect when k is a very small in comparison to n.
|
