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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Sebastian Wild, M.Sc., studied computer science at Technische Universität Kaiserslautern and now works on his Ph.D. on the analysis of algorithms.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783639679670
Quantità: 2 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Codice articolo 26357286205
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand. Codice articolo 356286178
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND. Codice articolo 18357286199
Quantità: 4 disponibili
Da: moluna, Greven, Germania
Condizione: 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 . Codice articolo 4997439
Quantità: Più di 20 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783639679670
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783639679670
Quantità: 1 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: 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. Codice articolo 104971789
Quantità: 5 disponibili