Category:Sort algorithms
From Free net encyclopedia
Revision as of 10:10, 14 April 2006; view current revision
←Older revision | Newer revision→
←Older revision | Newer revision→
In computer science and mathematics, a sort 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.cs:Kategorie:Algoritmy řazení de:Kategorie:Sortieralgorithmus es:Categoría:Algoritmos de ordenamiento fr:Catégorie:Algorithme de tri is:Flokkur:Röðunarreiknirit ja:Category:ソート pl:Kategoria:Sortowanie pt:Categoria:Algoritmos de ordenação sv:Kategori:Sorteringsalgoritmer he:קטגוריה:אלגוריתמי מיון