Category:Order statistic algorithms

From LiteratePrograms
Jump to: navigation, search

Order statistic problems include finding the minimum, maximum, median, and, most importantly, the nth largest (or smallest) element of a list. There are worst-case linear algorithms for finding each of these, which is ideal, but in practice expected linear-time algorithms for finding the median and nth largest or smallest element outperform the known worst-case linear algorithms. Related problems include finding the k largest (or smallest) elements of a list and sorting a list.

hijacker
hijacker
hijacker
hijacker

Subcategories

This category has only the following subcategory.