Computing Order Statistics
The problem of computing the kth smallest (or largest) element of a list is called the selection problem and is solved by a selection algorithm. Although this problem is difficult for very large lists, sophisticated selection algorithms have been created that can solve this problem in time proportional to the number of elements in the list, even if the list is totally unordered. If the data is stored in certain specialized data structures, this time can be brought down to O(log n). In many applications all order statistics are required, in which case a sorting algorithm can be used and the time taken is O(n log n).
Read more about this topic: Order Statistic
Famous quotes containing the words order and/or statistics:
“Dule and wae for the order sent our lads to the Border;
The English, for ance, by guile won the day:
The Flowers of the Forest, that foucht aye the foremost,
The prime o’ our land, are cauld in the clay.”
—Jean Elliot (1727–1805)
“He uses statistics as a drunken man uses lamp-posts—for support rather than illumination.”
—Andrew Lang (1844–1912)