Paperback: 592 pages
Publisher: Pearson; three version (October 9, 2011)
Based on a brand new classification of algorithm design methods and a transparent delineation of evaluation strategies,Introduction to the Design and Analysis of Algorithms presents the topic in a coherent and progressive method. Written in a student-friendly fashion, the guide emphasizes the understanding of concepts over excessively formal remedy whereas completely masking the materials required in an introductory algorithms course. Popular puzzles are used to encourage college students’ curiosity and strengthen their expertise in algorithmic downside fixing. Other learning-enhancement options embody chapter summaries, hints to the workout routines, and an in depth answer guide.
About the Author
Dr. Anany Levitin graduated from the Moscow State University with an MS diploma in Mathematics. He holds a Ph.D. diploma in Mathematics from the Hebrew University of Jerusalem and an MS diploma in Computer Science from the University of Kentucky. Introduction to the Design and Analysis of Algorithms has been translated into Chinese, Russian, Greek, and Korean and is utilized in a whole bunch of colleges throughout the world. Dr. Levitin can be the creator of Algorithmic Puzzles, publishing in Fall 2011.
Dr. Levitin teaches programs in the Design and Analysis of Algorithms at Villanova University.