数据结构和算法是基本功，Coursera上有很多数据结构和算法方面的经典课程，这里做个总结。
1. 普林斯顿大学 Sedgewick 教授的 算法1: Algorithms, Part I
这门算法课程已经开过很多轮，好评如潮 ，应该算得上是 Coursera 上的明星算法课程了，感兴趣的同学可以参考课程图谱上的旧版 课程评论，强烈推荐：
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.
2. 普林斯顿大学 Sedgewick 教授的 算法2: Algorithms, Part II
系列课程，依然强烈推荐，感兴趣的同学可以参考早期课程的评价：http://coursegraph.com/coursera_algs4partII
“Part II较Part I在部分Programming Assignments上增加了timing和memory的难度，API100%不再意味着全部100%，这正是这门课程的精华之处：不是灌输算法知识，而是通过实际操作的过程让学员深入理解数据结构和算法调优在经济上的意义。个人很喜欢论坛上大家在Performance Thread里贴出自己的report然后交流优化心得的过程，很有圆桌会议的架势。这门课的教授Robert Sedgewick师出名门，是Knuth在斯坦福的博士。老爷子年岁已近70，一直活跃在论坛上解答和讨论问题，敬业程度让人赞叹。”
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.
3. 斯坦福大学的 算法专项课程（Algorithms Specialization）
斯坦福大学的算法专项课程系列（Algorithms Specialization），这个系列包含4门子课程，涵盖基础的算法主题和高级算法主题，此前评价非常高，五颗星推荐，感兴趣的同学可以关注: Learn To Think Like A Computer Scientist-Master the fundamentals of the design and analysis of algorithms.
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.
可参考老版课程评论：Algorithms: Design and Analysis, Part 1 和 Algorithms: Design and Analysis, Part 2
3.1 Divide and Conquer, Sorting and Searching, and Randomized Algorithms
The primary topics in this part of the specialization are: asymptotic (“Big-oh”) notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
3.2 Graph Search, Shortest Paths, and Data Structures
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
3.3 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
3.4 Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
4. 北京大学的 程序设计与算法专项课程系列
据说是国内学生选择最多的中文程序设计课程，这个系列包含7门子课程，分别是计算导论与C语言基础， C程序设计进阶 ，C++程序设计， 算法基础， 数据结构基础， 高级数据结构与算法， 程序开发项目实践，最后一个项目实践课程联合腾讯公司设计一个实际的应用问题：搜索引擎设计。感兴趣的同学可以关注：
本专项课程旨在系统培养你的程序设计与编写能力。系列课程从计算机的基础知识讲起，无论你来自任何学科和行业背景，都能快速理解；同时我们又系统性地介绍了C程序设计，C++程序设计，算法基础，数据结构与算法相关的内容，各门课之间联系紧密，循序渐进，能够帮你奠定坚实的程序开发基础；课程全部配套在线编程测试，将有效地训练和提升你编写程序的实际动手能力。并通过结业实践项目为你提供应用程序设计解决复杂现实问题的锻炼，从而积累实际开发的经验。因此，我们希望本专项课程能够帮助你完成从仅了解基本的计算机知识到能够利用高质量的程序解决实际问题的转变。
5. 加州大学圣地亚哥分校的 数据结构与算法专项课程系列（Data Structures and Algorithms Specialization）
这个系列包含5门子课程和1门毕业项目课程，包括算法工具箱，数据结构 ，图算法，字符串算法 ，高级算法与算法复杂度，算法毕业项目 等，感兴趣的同学可以关注: Master Algorithmic Programming Techniques-Learn algorithms through programming and advance your software engineering or data science career
This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms…or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine.
