Content deleted Content added
Tag: possible test edits |
|||
Line 6:
Since the dawn of computing, the sorting problem has attracted a great deal of research, perhaps due to the complexity of solving it efficiently despite its simple, familiar statement. For example, [[bubble sort]] was analyzed as early as 1956.<ref>Demuth, H. Electronic Data Sorting. PhD thesis, Stanford University, 1956.</ref> Although many consider it a solved problem, useful new sorting algorithms are still being invented (for example, [[library sort]] was first published in 2004). Sorting algorithms are prevalent in introductory computer science classes, where the abundance of algorithms for the problem provides a gentle introduction to a variety of core algorithm concepts, such as [[big O notation]], [[divide and conquer algorithm]]s, [[data structure]]s, [[randomized algorithm]]s, [[best, worst and average case]] analysis, [[time-space tradeoff]]s, and lower bounds.
[[Media:Example.ogg]]== Classification ==<!-- This section is linked from [[Merge sort]] -->
Sorting algorithms used in [[computer science]] are often classified by:
| |||