Sorting algorithms: Difference between revisions
Jump to navigation
Jump to search
imported>Phil Deets m (added reference list) |
imported>Phil Deets m (added list of popular sorting algorithms) |
||
| Line 2: | Line 2: | ||
There are many different strategies that can be used to sort data. These include sorting by insertion, by exchanging, by selection, by merging, and by distribution.<ref>Donald Knuth, ''The Art of Computer Programming'' Addison-Wesley, 1973, ISBN 0-201-03803-X.</ref> | There are many different strategies that can be used to sort data. These include sorting by insertion, by exchanging, by selection, by merging, and by distribution.<ref>Donald Knuth, ''The Art of Computer Programming'' Addison-Wesley, 1973, ISBN 0-201-03803-X.</ref> | ||
Here are some popular sorting algorithms: | |||
*[[Quicksort]] | |||
*[[Heapsort]] | |||
*[[Mergesort]] | |||
*[[Shellsort]] | |||
*[[Insertion sort]] | |||
*[[Selection sort]] | |||
*[[Bubble sort]] | |||
==References== | ==References== | ||
Revision as of 21:47, 5 October 2007
Sorting algorithms are processes to follow for sorting lists of data. They are commonly used as an introduction to algorithms for students of computer science.
There are many different strategies that can be used to sort data. These include sorting by insertion, by exchanging, by selection, by merging, and by distribution.[1]
Here are some popular sorting algorithms:
References
- ↑ Donald Knuth, The Art of Computer Programming Addison-Wesley, 1973, ISBN 0-201-03803-X.