Sorting algorithm: Algorithm, Mathematics, Lexicographical Order, Canonicalization, Big O notation, Divide and Conquer Algorithm, Data Structure, Randomized Algorithm, Best, Worst and Average Case - Couverture souple

 
9786130347093: Sorting algorithm: Algorithm, Mathematics, Lexicographical Order, Canonicalization, Big O notation, Divide and Conquer Algorithm, Data Structure, Randomized Algorithm, Best, Worst and Average Case
Couverture souple
ISBN 10 : 613034709X ISBN 13 : 9786130347093
Editeur : Betascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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. More formally, the output must satisfy two conditions.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Betascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
613034709X
ISBN 13 
9786130347093
Reliure
Broché
Nombre de pages
104
Éditeur
Surhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
Coordonnées du fabricant
non disponible
Personne responsable
non disponible