马上注册，结交更多好友，享用更多功能，让你轻松玩转社区。
您需要 登录 才可以下载或查看，没有账号？注册
x
Mastering Basic Algorithms in the Python Language Learn to implement classic algorithms and design new problem-solving algorithms using Python
by Magnus Lie Hetland
Contents at a Glance Contents...................................................................................................................vi About the Author ...................................................................................................xiii About the Technical Reviewer ............................................................................... xiv Acknowledgments .................................................................................................. xv Preface .................................................................................................................. xvi ■ Chapter 1: Introduction........................................................................................1 ■ Chapter 2: The Basics ..........................................................................................9 ■ Chapter 3: Counting 101 ....................................................................................45 ■ Chapter 4: Induction and Recursion … and Reduction......................................71 ■ Chapter 5: Traversal: The Skeleton Key of Algorithmics .................................101 ■ Chapter 6: Divide, Combine, and Conquer........................................................125 ■ Chapter 7: Greed Is Good? Prove It!.................................................................151 ■ Chapter 8: Tangled Dependencies and Memoization .......................................175 ■ Chapter 9: From A to B with Edsger and Friends.............................................199 ■ Chapter 10: Matchings, Cuts, and Flows .........................................................221 ■ Chapter 11: Hard Problems and (Limited) Sloppiness .....................................241 ■ Appendix A: Pedal to the Metal: Accelerating Python .....................................271 ■ Appendix B: List of Problems and Algorithms .................................................275 ■ Appendix C: Graph Terminology.......................................................................285 ■ Appendix D: Hints for Exercises.......................................................................291
| 
/2 
eetop公众号
创芯大讲堂
创芯人才网
发表于 2020-10-4 20:05:36
