Jump to content

Sorting Algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by BlckKnght (talk | contribs) at 23:43, 24 September 2001. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A sorting algorithm is an algorithm that puts elements of a list into order. Efficient sorting is important to optimizing the use of other algorithms (such as search algorithms) that operate best on sorted lists.


Many common sorting algorithms are used in computer science. They vary in computational complexity and in usage of memory and other computer resources.

Some sorting algorithms are: