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

Sebastian Wild

ISBN 10: 3639679679 / ISBN 13: 9783639679670

Published by AV Akademikerverlag, 2014

About this Item

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 | Sebastian Wild | Taschenbuch | 208 S. | Englisch | 2014 | AV Akademikerverlag | EAN 9783639679670 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.

Seller Inventory # 104971789

Bibliographic Details

• Title: 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
• Publisher: AV Akademikerverlag
• Publication Date: 2014
• Language: English
• ISBN 10: 3639679679
• ISBN 13: 9783639679670
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 14D millimeters 220 millimeters width by 150 millimeters height by 14 millimeters depth
• Weight: 328 grams
• Seller catalogs:
  • Bücher

About this title

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.

About the Author

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