Where to go from here
2016-05-10 16:18
190 查看
Did you get through all of that content? Congratulations! You've learnt the fundamentals of algorithms, plus a lot of example algorithms.
There is much more to learn, if you want to dig deeper. Just look at Wikipedia's list of algorithms - there are thousands of them out there, plus there are the ones in your head that haven't made it into programs yet.
Thomas Cormen, co-author of this content, has also co-authored two books on algorithms:
Introduction to Algorithms: This is the most popular college textbook for algorithms. It is both rigorous—proving that algorithms are correct and have the claimed running times—and comprehensive—covering dozens of algorithms in over 1300 pages.
Algorithms Unlocked: This is targeted more at readers who want to get a taste of algorithms and how to analyze them. It's less mathematical than Introduction to Algorithms, and it includes a little more in the way of intuition and applications.
Other recommended books are The Algorithm Design Manual and Algorithm Design.
There are also several free 2-part courses offered online on Coursera:
Algorithms, I & II: An introductory course covering "basic iterable data types, sorting, and searching algorithms in Java".
Algorithms: Design and Analysis Part I & II: An introductory course that covers the "fundamental principles of algorithm design: divide-and-conquer methods, graph algorithms, practical data structures, randomized algorithms, and more" while being language agnostic.
We do plan to keep adding to this content here on Khan Academy, so check back here every few months for updates.
There is much more to learn, if you want to dig deeper. Just look at Wikipedia's list of algorithms - there are thousands of them out there, plus there are the ones in your head that haven't made it into programs yet.
Thomas Cormen, co-author of this content, has also co-authored two books on algorithms:
Introduction to Algorithms: This is the most popular college textbook for algorithms. It is both rigorous—proving that algorithms are correct and have the claimed running times—and comprehensive—covering dozens of algorithms in over 1300 pages.
Algorithms Unlocked: This is targeted more at readers who want to get a taste of algorithms and how to analyze them. It's less mathematical than Introduction to Algorithms, and it includes a little more in the way of intuition and applications.
Other recommended books are The Algorithm Design Manual and Algorithm Design.
There are also several free 2-part courses offered online on Coursera:
Algorithms, I & II: An introductory course covering "basic iterable data types, sorting, and searching algorithms in Java".
Algorithms: Design and Analysis Part I & II: An introductory course that covers the "fundamental principles of algorithm design: divide-and-conquer methods, graph algorithms, practical data structures, randomized algorithms, and more" while being language agnostic.
We do plan to keep adding to this content here on Khan Academy, so check back here every few months for updates.
相关文章推荐
- Google Map Api 谷歌地图接口整理
- beego模板语法 go语言模版语法
- google api 3
- Scrambled Polygon--poj2007(极角排序模板)
- mongo db brief intro
- Category和Extension
- Google APAC Test 2016 Not So Random 矩阵快递幂(logN复杂度)
- Django模型层Meta内部类详解
- Django urls配置
- Google深度学习笔记 Logistic Classification
- 《Go语言编程入门》视频课程开课了
- Google map api 初学
- 为韩春雨老师和他的 NgAgo-gDNA 点赞
- 为韩春雨老师和他的 NgAgo-gDNA 点赞
- 换新LOGO,58集团想从分类信息向生活服务巨头蜕变?
- 【bzoj1419】Red is good 期望dp
- django中的权限控制(form增删改)
- poj 2262 Goldbach's Conjecture -- 筛法求素数打表
- Django(一)多对一模型
- Django:URL-patterns的高级使用方式与URL传递参数