Java 7's Dual-Pivot Quicksort: An average-case analysis of the new default sorting method of Java and how it compares to classic algorithms - Couverture souple

Wild, Sebastian

 
9783639679670: Java 7's Dual-Pivot Quicksort: An average-case analysis of the new default sorting method of Java and how it compares to classic algorithms
Couverture souple
ISBN 10 : 3639679679 ISBN 13 : 9783639679670
Editeur : AV Akademikerverlag, 2014

Synopsis

With version 7 of Java, Oracle replaced its tried and tested sorting algorithm in the Java runtime library by an entirely new Quicksort variant proposed by Vladimir Yaroslavskiy. The decision to change the sorting method was based on empirical studies showing that the new algorithm is faster than the formerly used classic Quicksort. Surprisingly, this improvement is achieved with a dual-pivot approach—an idea considered not promising by theoretical studies in the past. In this book, we try to shed some light on the unexpected success by mathematically analyzing the new algorithm's performance. We focus on precise and fine-grained average-case analysis, aiming at the flavor of Donald Knuth's famous book series “The Art of Computer Programming”. In particular, we go beyond abstract measures like key comparisons and we prefer precise expected values to asymptotic approximations. This rigor ensures that the discussed sorting methods are usable in practice and that the analytic results contribute to a sound comparison of the Quicksort variants. This book is based on the author's master thesis on the same topic.

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

Présentation de l'éditeur

With version 7 of Java, Oracle replaced its tried and tested sorting algorithm in the Java runtime library by an entirely new Quicksort variant proposed by Vladimir Yaroslavskiy. The decision to change the sorting method was based on empirical studies showing that the new algorithm is faster than the formerly used classic Quicksort. Surprisingly, this improvement is achieved with a dual-pivot approach—an idea considered not promising by theoretical studies in the past. In this book, we try to shed some light on the unexpected success by mathematically analyzing the new algorithm's performance. We focus on precise and fine-grained average-case analysis, aiming at the flavor of Donald Knuth's famous book series “The Art of Computer Programming”. In particular, we go beyond abstract measures like key comparisons and we prefer precise expected values to asymptotic approximations. This rigor ensures that the discussed sorting methods are usable in practice and that the analytic results contribute to a sound comparison of the Quicksort variants. This book is based on the author's master thesis on the same topic.

Biographie de l'auteur

Sebastian Wild, M.Sc., studied computer science at Technische Universität Kaiserslautern and now works on his Ph.D. on the analysis of algorithms.

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

Éditeur
AV Akademikerverlag
Date d'édition
2014
Langue
anglais
ISBN 10 
3639679679
ISBN 13 
9783639679670
Reliure
Broché
Nombre de pages
208
Coordonnées du fabricant
non disponible
Personne responsable
non disponible