Sorting (eBook)

A Distribution Theory

Hosam M. Mahmoud (Autor)

eBook Download: PDF

2011 | 1. Auflage
416 Seiten
John Wiley & Sons (Verlag)
9781118031131 (ISBN)

Infos

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

Autor

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).

Inhalt

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.

Rezensionen

"Discussion of a range of common sorting approaches...with emphasis
on, and analysis of, the distributions associated with the
complexity measures on the algorithms." (American Mathematical
Monthly, March 2002)

"...this book, in addition to being a reference book for
computer professionals, is a good book to be used in teaching..."
(Mathematical Reviews, 2003a)

Produkt-Details

• Erscheint lt. Verlag: 14.10.2011
• Reihe/Serie: Wiley-Interscience Series in Discrete Mathematics and Optimization
• Reihe/Serie: Wiley-Interscience Series in Discrete Mathematics and Optimization
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Technik
• Schlagworte: Applied Mathematics in Science • Computer Science • Computer Science Special Topics • Discrete Mathematics • Diskrete Mathematik • Informatik • Mathematics • Mathematik • Mathematik in den Naturwissenschaften • Spezialthemen Informatik
• ISBN-13: 9781118031131 / 9781118031131