Sorting algorithms

From Citizendium
Revision as of 20:38, 5 October 2007 by imported>Phil Deets (added reference list)
Jump to navigation Jump to search

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]

References

  1. ↑ Donald Knuth, The Art of Computer Programming Addison-Wesley, 1973, ISBN 0-201-03803-X.
Retrieved from "https://citizendium.org/wiki/index.php?title=Sorting_algorithms&oldid=305433"