Sorting : a distribution theory /

Bibliographic Details
Main Author: Mahmoud, Hosam M (Hosam Mahmoud), 1954-
Format: Book
Language:English
Published: New York : John Wiley & Sons, 2000
New York : [2000], ©2000
New York : c2000
Series:Wiley-Interscience series in discrete mathematics and optimization
Wiley series in discrete mathematics and optimization
Wiley-Interscience series in discrete mathematics and optimization
Subjects:
Table of Contents:
  • 1 Sorting and Associated Concepts
  • 2. Insertion Sort
  • 3. Shell Sort
  • 4. Bubble Sort
  • 5. Selection Sort
  • 6. Sorting by Counting
  • 7. Quick Sort
  • 8. Sample Sort
  • 9. Heap Sort
  • 10. Merge Sort
  • 11. Bucket Sorts
  • 12. Sorting Nonrandom Data
  • 13. Epilogue
  • Appendix. Notation and Standard Results from Probability Theory.
  • 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