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:
“A man is a method, a progressive arrangement; a selecting principle, gathering his like to him; wherever he goes.”
—Ralph Waldo Emerson (1803–1882)
“The smallest flower is a thought, a life answering to some feature of the Great Whole, of whom they have a persistent intuition.”
—Honoré De Balzac (1799–1850)
“He was the man who of all modern, and perhaps ancient poets, had the largest and most comprehensive soul.... He needed not the spectacles of books to read Nature; he looked inwards, and found her there.”
—John Dryden (1631–1700)
“English general and singular terms, identity, quantification, and the whole bag of ontological tricks may be correlated with elements of the native language in any of various mutually incompatible ways, each compatible with all possible linguistic data, and none preferable to another save as favored by a rationalization of the native language that is simple and natural to us.”
—Willard Van Orman Quine (b. 1908)