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 - Softcover
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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Search results for Java 7's Dual-Pivot Quicksort: An average-case...
Seller Image
Java 7's Dual-Pivot Quicksort
Published by
AV Akademikerverlag Dez 2014, 2014
ISBN 10: 3639679679
ISBN 13: 9783639679670
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 208 pp. Englisch. Seller Inventory # 9783639679670
Stock Image
Java 7's Dual-Pivot Quicksort
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 26357286205
Stock Image
Java 7's Dual-Pivot Quicksort
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand. Seller Inventory # 356286178
Buy New
£ 65.11
£ 6.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Seller Image
Java 7 s Dual-Pivot Quicksort
Print on DemandSeller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Wild SebastianSebastian Wild, M.Sc., studied computer science at Technische Universitaet Kaiserslautern and now works on his Ph.D. on the analysis of algorithms.With version 7 of Java, Oracle replaced its tried and tested sorting . Seller Inventory # 4997439
Buy New
£ 32.93
£ 42.28 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Java 7's Dual-Pivot Quicksort
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND. Seller Inventory # 18357286199
Seller Image
Java 7's Dual-Pivot Quicksort
Published by
AV Akademikerverlag Dez 2014, 2014
ISBN 10: 3639679679
ISBN 13: 9783639679670
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 208 pp. Englisch. Seller Inventory # 9783639679670
Seller Image
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
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9783639679670
Seller Image
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
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. 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