| Publication |
India, Dorling Kindersley Limited, 2008.
|
| Description |
588pBlue Spine
|
| Summary/Abstract |
This book provides a coherent and pedagogically sound framework for learning and teaching algorithms.
|
| 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. Iterative Improvement
11. Limitations of Algorithm Power
12. Coping with the Limitations of Algorithm Power
Epilogue
Appendix A: Useful formulas for the analysis of Algorithms
Appendix B: Short tutorial on Recurrence Relations
|
| Standard Number |
8131718568 Pb.
|