Sorting

A cutting-edge look at the emerging distributional theory of sorting<br> <br> 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.<br> <br> 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:<br> * Contains introductory material on complete and partial sorting<br> * Explains insertion sort, quick sort, and merge sort, among other methods<br> * Offers verbal descriptions of the mechanics of the algorithms as well as the necessary code<br> * Illustrates the distribution theory of sorting using a broad array of both classical and modern techniques<br> * Features a variety of end-of-chapter exercises