Hardcover 100% of proceeds go to charity! Good condition with all pages in tact. Item shows signs of use and may have cosmetic defects.

Hardcover 100% of proceeds go to charity! Good condition with all pages in tact. Item shows signs of use and may have cosmetic defects.

6" X 9", 492 pages. This book provides a thorough introduction to the primary

6" X 9", 492 pages. This book provides a thorough introduction to the primary techniques used in the mathematical analysis of algorithms. The authors draw from classical mathematical material, including discrete mathematics, elementary real analysis, and combinatorics, as well as from classical computer science material, including algorithms and data structures. They focus on "average-case" or "Probabilistic" analysis, although they also cover the basic mathematical tools reqiued for "worst-case" or "complexity" analysis. Topics include recurrences, generating functions, asymptotics, trees, strings, maps, and an analysis of sorting, tree search, string search, and hashing algorithms.