This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented.
I have a question about the book:
‘Techniques for Designing and Analyzing Algorithms - Stinson, Douglas R. (University of Waterloo’.
Fill in the form below.
We will respond as fast as possible.
