Introduction to The Design and Analysis of Algorithms Anany Levitin English
Material type:
- 978-93-325-8548-5
- 23 004 LEV
Contents:
Preface
1. Introduction
2. Fundamentals of the Analysis of Algorithm Efficiency
3. Brute Force
4. Divide-and-Conquer
5. Decrease-and-Conquer
6. Transform-and-Conquer
7. Space and Time Tradeoffs
8. Dynamic Programming
9. Greedy Technique
10. Limitations of Algorithm Power
11. Coping with the Limitations of Algorithm Power
Appendix A: Useful Formulas for the Analysis of Algorithms
Appendix B: Short Tutorial on Recurrence Relations
Bibliography
Index
Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
![]() |
Tetso College Library Computer Science | Non-fiction | 004 LEV (Browse shelf(Opens below)) | Available | 10354 | ||
![]() |
Tetso College Library Computer Science | Non-fiction | 004 LEV (Browse shelf(Opens below)) | Available | 10353 |
Preface
1. Introduction
2. Fundamentals of the Analysis of Algorithm Efficiency
3. Brute Force
4. Divide-and-Conquer
5. Decrease-and-Conquer
6. Transform-and-Conquer
7. Space and Time Tradeoffs
8. Dynamic Programming
9. Greedy Technique
10. Limitations of Algorithm Power
11. Coping with the Limitations of Algorithm Power
Appendix A: Useful Formulas for the Analysis of Algorithms
Appendix B: Short Tutorial on Recurrence Relations
Bibliography
Index
There are no comments on this title.
Log in to your account to post a comment.