Sorting Algorithm: Difference between revisions
Content deleted Content added
mNo edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
A <b>sorting algorithm</b> 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 algorithm]]s) that operate best on sorted lists. |
|||
<p>Many common sorting algorithms are used in [[computer science]]. They vary in [[computational complexity]] and in usage of memory and other computer resources. |
|||
<p>Some sorting algorithms are: |
|||
<ul> |
|||
<li>[[Bubble sort]] |
|||
<li>[[Shell sort]] |
|||
<li>[[Quicksort]] |
|||
<li>[[Merge sort]] |
|||
<li>[[Radix sort]] |
|||
</ul> |
|||
Revision as of 23:43, 24 September 2001
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: