| 经典原著，原味赏析. 角度新颖，独树一帜.. 注重实践，学练结合 教辅齐全，获取便捷... |
| (美) Anany Levitin是Villanova大学计算科学系的教授。他的论文A New Road Map of Algorithm Design Techniques：Picking Up Where the Traditi。onal Classification Leaves Off(《算法设计技术新途径：弥补传统分类法的缺·感》)受到业内人士极高的评价。在SIGCSE会议上，作者做过多次关于算法教学的演讲。 .. << 查看详细 |
| preface 1 introduction 1.1 what is an algorithm? exercises 1.1 1.2 fundamentals of algorithmic problem solving understanding the problem ascertaining the capabilities of a computational device choosing between exact and approximate problem solving deciding on appropriate data structures algorithm design techniques methods of specifying an algorithm proving an algorithm's correctness analyzing an algorithm coding an algorithm exercises 1.2 1.3 important problem types sorting searching string processing graph problems . combinatorial problems geometric problems numerical problems exercises 1.3 1.4 fundamental data structures linear data structures graphs trees sets and dictionaries exercises 1.4 summary 2 fundamentals of the analysis of algorithm efficiency 2.1 analysis framework measuring an input's size units for measuring running -[]me orders of growth worst-case, best-case, and average-case efficlencies recapitulation of the analysis framework exercises 2.1 2.2 asymptotic notations and basic efficiency classes informal introduction o-notation 9-notation onotation useful property involving the asymptotic notations using limits for comparing orders of growth basic efficiency classes exercises 2.2 2.3 mathematical analysis of nonrecursive algorithms exercises 2.3 2.4 mathematical analysis of recursive algorithms exercises 2.4 2.5 example: fibonacci numbers explicit formula for the nth fibonacci number algorithms for computing fibonacci numbers exercises 2.5 3 brute force 4 divide-and-conquer 5 decrease-and-conquer 6 transform-and-conquer 7 space and lime 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 bibliography hints to exercises index |
内容加载中，请稍后...
商品评论（0条）