| 姓名：(美)谢弗(Shaffer C.A.)著 作者简介： 作品：《数据结构与算法分析-第二版-C++版》 |
| ⅰ preliminaries 1 data structures and algorithms 1.1 a philosophy of data structures 1.1.1 the need for data structures 1.1.2 costs and benefits 1.2 abstract data types and data structures 1.3 problems, algorithms, and programs 1.4 further reading 1.5 exercises 2 mathematical preliminaries 2.1 sets and relations 2.2 miscellaneous notation 2.3 logarithms 2.4 recursion 2.5 summations and recurrences 2.6 mathematical proof techniques 2.6.1 proof by contradiction 2.6.2 proof by mathematical induction 2.7 estimating 2.8 further reading 2.9 exercises 3 algorithm analysis 3.1 introduction 3.2 best, worst, and average cases 3.3 a faster computer, or a faster algorithm? 3.4 asymptotic analysis 3.4.1 upper bounds 3.4.2 lower bounds 3.4.3 notation 3.4.4 simplifying rules 3.5 calculating the running time of 更多 |
内容加载中，请稍后...
商品评论（0条）