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:
“When a person hasn’t in him that which is higher and stronger than all external influences, it is enough for him to catch a good cold in order to lose his equilibrium and begin to see an owl in every bird, to hear a dog’s bark in every sound.”
—Anton Pavlovich Chekhov (1860–1904)
“and Olaf, too
preponderatingly because
unless statistics lie he was
more brave than me: more blond than you.”
—E.E. (Edward Estlin)