Sorting / Wiley-Interscience Series in Discrete Mathematics and Optimization (PDF)
A Distribution Theory
(Sprache: Englisch)
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...
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...
sofort als Download lieferbar
eBook (pdf)
185.99 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Sorting / Wiley-Interscience Series in Discrete Mathematics and Optimization (PDF)“
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
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
Inhaltsverzeichnis zu „Sorting / Wiley-Interscience Series in Discrete Mathematics and Optimization (PDF)“
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.
Autoren-Porträt von Hosam M. Mahmoud
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).
Bibliographische Angaben
- Autor: Hosam M. Mahmoud
- 2011, 1. Auflage, 416 Seiten, Englisch
- Verlag: John Wiley & Sons
- ISBN-10: 111803113X
- ISBN-13: 9781118031131
- Erscheinungsdatum: 14.10.2011
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 14 MB
- Mit Kopierschutz
Sprache:
Englisch
Kopierschutz
Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie lesen. Zum Lesen auf sonstigen eReadern und am PC benötigen Sie eine Adobe ID.
Kommentar zu "Sorting / Wiley-Interscience Series in Discrete Mathematics and Optimization"
0 Gebrauchte Artikel zu „Sorting / Wiley-Interscience Series in Discrete Mathematics and Optimization“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Sorting / Wiley-Interscience Series in Discrete Mathematics and Optimization".
Kommentar verfassen