Sorting
A Distribution Theory
Seiten
2000
Wiley-Interscience (Verlag)
9780471327103 (ISBN)
Wiley-Interscience (Verlag)
9780471327103 (ISBN)
- Titel z.Zt. nicht lieferbar
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
This work covers the emerging distributional theory of sorting. It book opens with a chapter on the general area of complete and partial sorting. The following chapters discuss every standard sorting algorithm with a careful explanation of the mechanics of the algorithm both as code and verbally.
A cutting-edge look at the emerging distributional theory of sorting
Research on distributions associated with sorting algorithms has grown dramatically over the last few decades, spawning many exact and limiting distributions of complexity measures for many sorting algorithms. Yet much of this information has been scattered in disparate and highly specialized sources throughout the literature. In Sorting: A Distribution Theory, leading authority Hosam Mahmoud compiles, consolidates, and clarifies the large volume of available research, providing a much-needed, comprehensive treatment of the entire emerging distributional theory of sorting.
Mahmoud carefully constructs a logical framework for the analysis of all standard sorting algorithms, focusing on the development of the probability distributions associated with the algorithms, as well as other issues in probability theory such as measures of concentration and rates of convergence. With an emphasis on narrative rather than technical explanations, this exceptionally well-written book makes new results easily accessible to a broad spectrum of readers, including computer professionals, scientists, mathematicians, and engineers. Sorting: A Distribution Theory:
* Contains introductory material on complete and partial sorting
* Explains insertion sort, quick sort, and merge sort, among other methods
* Offers verbal descriptions of the mechanics of the algorithms as well as the necessary code
* Illustrates the distribution theory of sorting using a broad array of both classical and modern techniques
* Features a variety of end-of-chapter exercises
A cutting-edge look at the emerging distributional theory of sorting
Research on distributions associated with sorting algorithms has grown dramatically over the last few decades, spawning many exact and limiting distributions of complexity measures for many sorting algorithms. Yet much of this information has been scattered in disparate and highly specialized sources throughout the literature. In Sorting: A Distribution Theory, leading authority Hosam Mahmoud compiles, consolidates, and clarifies the large volume of available research, providing a much-needed, comprehensive treatment of the entire emerging distributional theory of sorting.
Mahmoud carefully constructs a logical framework for the analysis of all standard sorting algorithms, focusing on the development of the probability distributions associated with the algorithms, as well as other issues in probability theory such as measures of concentration and rates of convergence. With an emphasis on narrative rather than technical explanations, this exceptionally well-written book makes new results easily accessible to a broad spectrum of readers, including computer professionals, scientists, mathematicians, and engineers. Sorting: A Distribution Theory:
* Contains introductory material on complete and partial sorting
* Explains insertion sort, quick sort, and merge sort, among other methods
* Offers verbal descriptions of the mechanics of the algorithms as well as the necessary code
* Illustrates the distribution theory of sorting using a broad array of both classical and modern techniques
* Features a variety of end-of-chapter exercises
HOSAM M. MAHMOUD, PhD, is a professor at The George Washington University, Washington, D.C., and the author of Evolution of Random Search Trees (also from Wiley).
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.
Bibliography.
Index.
| Erscheint lt. Verlag | 5.9.2000 |
|---|---|
| Reihe/Serie | Wiley-Interscience Series in Discrete Mathematics and Optimization |
| Sprache | englisch |
| Maße | 162 x 239 mm |
| Gewicht | 708 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Angewandte Mathematik |
| ISBN-13 | 9780471327103 / 9780471327103 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
für Ingenieure und Naturwissenschaftler
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 48,95
Buch | Softcover (2025)
Springer Vieweg (Verlag)
CHF 62,95
Buch | Softcover (2025)
Springer Fachmedien Wiesbaden (Verlag)
CHF 69,95
