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 to 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.

Combinatorial algorithms

Kategorie:Algoritmy řazení | Kategorie:Sortieralgorithmus | Categoría:Algoritmos de ordenamiento | Catégorie:Algorithme de tri | 분류:정렬 알고리즘 | Flokkur:Röðunarreiknirit | קטגוריה:אלגוריתמי מיון | Category:ソート | Kategoria:Sortowanie | Categoria:Algoritmos de ordenação | Категория:Алгоритмы сортировки | Kategori:Sorteringsalgoritmer | Категорія:Алгоритми сортування | Category:排序算法