Python零基础入门篇 vs CLRS.Helper

《Python零基础编程系列》相当于市面上价格动辄数千元的计算机编程培训课程。本套教程由现任新加坡知名游戏工作室的两位资深程序员精心设计和讲解，特别为初学编程的学生设计。通过实战Python项目，学习当今世界上最流行的编程语言。 本篇适合学完《Scratch中文教程系列》的学生，也适合初学者作为第一门编程语言学习。通过众多精心设计的实战项目，并且附带小作业和解答，详细解答初学者学习编程的困惑。 "Python" and Python logo are trademarks of the Python Software Foundation.

Refer to The third edition of the book, covering content: 2. Getting Started: Insertion sort, Merge sort; 4. Divide-and-Conquer: Maximum-subarray, Matrix Multiplication[normal, recursive, Strassen’s algorithm]; 6. Heapsort: Heapsort[max-heap, min-heap]; 7. Quicksort: Quicksort; 8. Sorting in Linear Time: Counting sort; 12. Binary Search Trees: Binary search tree[Inorder Walk, Search Recursive, Search Iterative, Minimum Iterative, Maximum Iterative, Successor, Predecessor, Insert, Delete]; 13. Red-Black Trees: Red Black Tree[Insert, Delete]; 15. Dynamic Programming: Rod cutting[Recursive, Top_down, Bottom_up, Print],Longest common subsequence; 16. Greedy Algorithms: Acitivity selection[Recursive, Iterative],Huffman codes; 22. Elementary Graph: Breadth-first search, Depth-first search, Topological sort, Strongly connected components; 23. Minimum Spanning Trees: Minimum spanning tree[Kruskal’s algorithm，Prim’s algorithm]; 24. Single-Source Shortest Paths: The Bellman-Ford algorithm，DAG algorithm，Dijkstra’s algorithm; 25. All-pairs Shortest Paths: All-pairs Shortest paths algorithms[Slow，Faster，The Floyd-Warshall algorithm]; 26. Maximum Flow: The Ford-Fulkerson algorithm; Addition: Tower of Hanoi，N Queens Problem，Comparison of sorting algorithms; The primary features: You can run the pseudo-code single step or continuous, observe the change of parameters and data structures，it can help you to understand the design thought of the algorithm; You can set breakpoints in program and ovserve the status of breakpoint, it can help you to understand why this algorithm is corrcet by using loop invariants; With running-time function stacks and the returning positions，you can track the running process of recursive functions easily, and understand the operation mechanism of computer programs; By recording the performed times of the pseudo-codes can help you to understand the running time of algorithms; I wish this app can be helpful to you;