Selecting K Smallest or Largest Elements
Another fundamental selection problem is that of selecting the k smallest or k largest elements, which is particularly useful where we want to present just the "top k" of an unsorted list, such as the top 100 corporations by gross sales. This is also commonly called partial sorting.
Read more about this topic: Selection Algorithm
Famous quotes containing the words selecting, smallest, largest and/or elements:
“But compared with the task of selecting a piece of French pastry held by an impatient waiter a move in chess is like reaching for a salary check in its demand on the contemplative faculties.”
—Robert Benchley (1889–1945)
“The person whose doors I enter with most pleasure, and quit with most regret, never did me the smallest favour.”
—William Hazlitt (1778–1830)
“We saw many straggling white pines, commonly unsound trees, which had therefore been skipped by the choppers; these were the largest trees we saw; and we occasionally passed a small wood in which this was the prevailing tree; but I did not notice nearly so many of these trees as I can see in a single walk in Concord.”
—Henry David Thoreau (1817–1862)
“Icebergs behoove the soul
(both being self-made from elements least visible
to see them so; fleshed, fair, erected indivisible.”
—Elizabeth Bishop (1911–1979)