Category:Selection algorithm

From LiteratePrograms
Jump to: navigation, search

A selection algorithm computes the kth largest or kth smallest element in an unordered list of values. A particularly common case is finding the median. Another common selection problem is finding the k largest or k smallest elements in a list in order. The most efficient known selection algorithms in practice and theory are based on the partition operation used in quicksort.

hijacker
hijacker
hijacker
hijacker

Pages in category "Selection algorithm"

The following 2 pages are in this category, out of 2 total.