Kooperativer Bibliotheksverbund

UID:

Format: 1 online resource (xv, 394 pages) : , illustrations

ISBN: 9781118032886 , 1118032888 , 9781118031131 , 111803113X

Note: Front Matter -- Sorting and Associated Concepts -- Insertion Sort -- Shell Sort -- Bubble Sort -- Selection Sort -- Sorting by Counting -- Quick Sort -- Sample Sort -- Heap Sort -- Merge Sort -- Bucket Sorts -- Sorting Nonrandom Data -- Epilogue -- Answers to Exercises -- Appendix: Notation and Standard Results from Probability Theory -- Bibliography -- Index -- Wiley-Interscience Series in Discrete Mathematics and Optimization. , Sorting and Associated Concepts -- , Sorting -- , Selection -- , Jargon -- , Algorithmic Conventions -- , Order -- , Binary Trees -- , Decision Trees -- , Bounds on Sorting -- , Lower Bounds on Sorting -- , Upper Bounds on Sorting -- , Bounds on Selection -- , Lower Bounds on Selection -- , Upper Bounds on Selection -- , Random Permutations -- , Records -- , Inversions -- , Cycles -- , Runs -- , An Analytic Toolkit -- , The Saddle Point Method -- , The Mellin Transform -- , Poissonization -- , The Dirichlet Transform -- , Rice's Method -- , Insertion Sort -- , A General Framework -- , A Sufficient Condition for Normality -- , Linear Insertion Sort -- , Binary Insertion Sort -- , Shell Sort -- , The Algorithm -- , Streamlined Stochastic Analysis -- , The Empirical Distribution Function -- , The Brownian Bridge -- , Using the Stochastic Tools -- , Other Increment Sequences -- , Bubble Sort -- , The Algorithm -- , A limit Law for Passes -- , A Limit Law for Comparisons -- , Selection Sort -- , The Algorithm -- , Analysis -- , Sorting by Counting -- , Count Sort -- , Sorting by Counting Frequencies -- , Quick Sort -- , The Partitioning Stage -- , Bookkeeping -- , Quick Sort Tree -- , Probabilistic Analysis of Quick Sort -- , Quick Selection -- , Hoare's Find -- , Multiple Quick Select -- , Sample Sort -- , The Small Sample Algorithm -- , The Large Sample Algorithm -- , Heap Sort -- , The Heap -- , Sorting via a Heap -- , Merge Sort -- , Merging Sorted Lists -- , Linear Merge -- , Binary Merge -- , The Hwang-Lin Merging Algorithm -- , The Merge Sort Algorithm -- , Distributions -- , Bottom-Up Merge Sort -- , Bucket Sorts.

Additional Edition: Print version: Mahmoud, Hosam M. (Hosam Mahmoud), 1954- Sorting. New York : John Wiley & Sons, 2000 ISBN 0471327107

Language: English

Keywords: Electronic books. ; Electronic books. ; Electronic books.

URL: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032886

URL: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032886

URL: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032886

UID:

Format: XIII, 394 S. , graph. Darst.

ISBN: 0471327107

Series Statement: Wiley-interscience series in discrete mathematics and optimization

Note: Literaturverz. S. 373 - 387

Language: English

Subjects: Mathematics

Keywords: Sortierverfahren ; Aufsatzsammlung ; Lehrbuch

URL: Publisher description

URL: Table of Contents

URL: Inhaltsverzeichnis

URL: Inhaltsverzeichnis

URL: Autorenbiografie

URL: Verlagsangaben

URL: Cover

URL: Inhaltstext

URL: http://www.loc.gov/catdir/toc/onix05/99086783.html