Selection Algorithm - Selecting K Smallest or Largest Elements

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)

    “He put before them another parable: “The kingdom of heaven is like a mustard seed that someone took and sowed in his field; it is the smallest of all the seeds, but when it has grown it is the greatest of shrubs and becomes a tree, so that the birds of the air come and make nests in its branches.””
    —Bible: New Testament, Matthew 13:31,32.

    “The eager fate which carried thee
    Took the largest part of me:
    For this losing is true dying;
    This is lordly man’s down-lying,
    This his slow but sure reclining,
    Star by star his world resigning.”
    —Ralph Waldo Emerson (1803–1882)

    “A party of order or stability, and a party of progress or reform, are both necessary elements of a healthy state of political life.”
    —John Stuart Mill (1806–1873)