Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because of the extreme importance of sorting in almost all computer algorithm and database applications, a great deal of effort has been expended in the creation and analysis of efficient sorting algorithms. A number of common sorting algorithms include heapsort, merge sort, quicksort, selection sort, and shellsort.

See also

Heapsort, Ordering, Merge Sort, Quicksort, Radix Sort, Selection Sort, Shellsort, Sort-Then-Add Sequence, Weighing


Knuth, D. E. The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed. Reading, MA: Addison-Wesley, 1998.National Institute of Standards and Technology. "Sort.", W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. "Sorting." Ch. 8 in Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed. Cambridge, England: Cambridge University Press, pp. 320-339, 1992.Skiena, S. "Sorting and Searching." §1.1.6 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 14-16, 1990.

Referenced on Wolfram|Alpha


Cite this as:

Weisstein, Eric W. "Sorting." From MathWorld--A Wolfram Web Resource.