Nonlinear General Selection Algorithm
Using the same ideas used in minimum/maximum algorithms, we can construct a simple, but inefficient general algorithm for finding the kth smallest or kth largest item in a list, requiring O(kn) time, which is effective when k is small. To accomplish this, we simply find the most extreme value and move it to the beginning until we reach our desired index. This can be seen as an incomplete selection sort. Here is the minimum-based algorithm:
function select(list, k) for i from 1 to k minIndex = i minValue = list for j from i+1 to n if list < minValue minIndex = j minValue = list swap list and list return listOther advantages of this method are:
- After locating the jth smallest element, it requires only O(j + (k-j)2) time to find the kth smallest element, or only O(1) for k ≤ j.
- It can be done with linked list data structures, whereas the one based on partition requires random access.
Read more about this topic: Selection Algorithm
Famous quotes containing the words general and/or selection:
“In the drawing room [of the Queen’s palace] hung a Venus and Cupid by Michaelangelo, in which, instead of a bit of drapery, the painter has placed Cupid’s foot between Venus’s thighs. Queen Caroline asked General Guise, an old connoisseur, if it was not a very fine piece? He replied “Madam, the painter was a fool, for he has placed the foot where the hand should be.””
—Horace Walpole (1717–1797)
“When you consider the radiance, that it does not withhold
itself but pours its abundance without selection into every
nook and cranny”
—Archie Randolph Ammons (b. 1926)