Stock image for illustration purposes only - book cover, edition or condition may vary.
Description for Sorting
Hardcover. 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. Series: Wiley Series in Discrete Mathematics and Optimization. Num Pages: 416 pages, bibliography. BIC Classification: PBT; PBW. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 242 x 167 x 24. Weight in Grams: 712.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
2000
Publisher
John Wiley & Sons Inc United States
Number of pages
416
Condition
New
Series
Wiley Series in Discrete Mathematics and Optimization
Number of Pages
416
Place of Publication
, United States
ISBN
9780471327103
SKU
V9780471327103
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
About 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).
Reviews for Sorting
"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)