Covers the mathematical foundations of the analysis of algorithms. This book considers the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide and Conquer. It is suitable for undergraduate students in computer science and mathematics.
Suitable for students and engineers alike, specifically software engineers who design reliable code, this title covers the traditional algorithms of Computer Science such as Greedy, Dynamic Programming and Divide & Conquer.