CLRS.Helper
A tool for studying CLRS
#1 Keyword Rankings
Today
Top 10 Rankings
Today
Top 30 Rankings
Today
Top 100 Rankings
Today
Description
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;
Hide..
Show more..
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;
Screenshots
User Rating
0 out of 5
0 ratings in Portugal
Ratings History
Reviews
App doesn't have any reviews yet
Store Rankings
Ranking History
App Ranking History not available yet
Category Rankings
App is not ranked yet
Keywords
Users may also like
| Name | Reviews | Recent release | |
|---|---|---|---|
Data Structure Display
Dynamic Presentation for DS
|
0
|
3 months ago | |
C/C++$-offline compiler for os
Good helper for C/C++ Learning
|
0
|
1 year ago | |
websta$-learn html css and js
A good helper for learning web
|
0
|
1 year ago | |
数据结构与算法
程序员的算法宝典-多语言详解
|
0
|
2 years ago | |
互动教程 for Photoshop脚本 珍藏版
手把手教你实用的Photoshop自动化和批处理技术！
|
0
|
3 years ago | |
Algoritmos(Compatível com VPP)
Explicados e Animados
|
0
|
3 years ago | |
pythoni3.5$-run code,outline,1
Good helper for python Learn
|
0
|
1 year ago | |
Tabela periódica visual
informação do elemento
|
0
|
1 month ago | |
Algorithms HQ
|
0
|
1 year ago | |
历史大事记
在历史地图上浏览影响世界历史进程的大事件
|
0
|
1 month ago |
Show More
Revenue and Downloads
Gain valuable insights into 算法导论.助手 performance with our analytics. Sign up now
to
access downloads, revenue, and more.
App Info
- Category
- Education
- Publisher
- 巍 顾
- Languages
- English, Chinese
- Recent version
- 1.8 (2 years ago )
- Released on
- Apr 23, 2021 (3 years ago )
- Also available in
- China, United States, Poland, Japan, South Korea, Kuwait, Kazakhstan, Lebanon, Mexico, Malaysia, Nigeria, Netherlands, Norway, New Zealand, Peru, Philippines, Pakistan, Italy, Portugal, Romania, Russia, Saudi Arabia, Sweden, Singapore, Thailand, Turkey, Taiwan, Ukraine, Vietnam, South Africa, Algeria, Argentina, Austria, Australia, Belgium, Brazil, Belarus, Canada, Switzerland, Chile, Colombia, Czechia, Germany, Denmark, United Arab Emirates, Ecuador, Egypt, Spain, Finland, France, United Kingdom, Greece, Hong Kong, Hungary, Indonesia, Ireland, Israel, India
- Last updated
- 1 month ago