Sorting algorithm

related topics
{math, number, function}
{style, bgcolor, rowspan}
{system, computer, user}
{rate, high, increase}
{@card@, make, design}
{household, population, female}

In computer science and mathematics, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) that require sorted lists to work correctly; it is also often useful for canonicalizing data and for producing human-readable output. More formally, the output must satisfy two conditions:

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.[1] 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 algorithms, data structures, randomized algorithms, best, worst and average case analysis, time-space tradeoffs, and lower bounds.


Full article ▸

related documents
Truth table
Stochastic process
Multiplication algorithm
Lie algebra
Support vector machine
Taylor series
Uniform space
Relational database
Quadratic equation
Exponentiation by squaring
General linear group
Subset sum problem
Vacuous truth
Busy beaver
Imaginary unit
Finite set
Halting problem
Dylan (programming language)
Control flow
Lp space
Fermat number
P = NP problem
Hamming code
Mathematical constant
Ackermann function
BCH code