Introduction to The Design and Analysis of Algorithm III edition, Pearson publication , by Anany Levitin of Villanova University.

Contents:


  1. Fundamentals of the analysis of algorithm efficiency
  2. Brute Force and Exhaustive search
  3. Decrease and Conquer
  4. Divide and Conquer
  5. Transform and Conquer
  6. Space and Time Trade Offs
  7. Dynamic Programming
  8. Greedy Technique
  9. Iterative Improvement
  10. Limitations of Algorithm Power
  11. Coping with the Limitations of Algorithm power
Download link:

Categories:

5 Responses so far.

  1. Unknown says:

    thanks.......i got the book.......found nowhere else.....

  2. Unknown says:

    thank you so much :))

Leave a Reply