非常好
简洁
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
CLRS.Helper FAQ
-
Is CLRS.Helper free?
CLRS.Helper is not free (it costs 0.99), however it doesn't contain in-app purchases or subscriptions.
-
Is CLRS.Helper legit?
Not enough reviews to make a reliable assessment. The app needs more user feedback.
Thanks for the vote -
How much does CLRS.Helper cost?
The price of CLRS.Helper is 0.99.
-
What is CLRS.Helper revenue?
To get estimated revenue of CLRS.Helper app and other AppStore insights you can sign up to AppTail Mobile Analytics Platform.
User Rating
App is not rated in France yet.
Ratings History
CLRS.Helper Reviews
Store Rankings
Ranking History
App Ranking History not available yet
Category Rankings
|
Chart
|
Category
|
Rank
|
|---|---|---|
|
Top Paid
|
|
410
|
CLRS.Helper Competitors
| Name | Downloads (30d) | Monthly Revenue | Reviews | Ratings | Recent release | |
|---|---|---|---|---|---|---|
Linuxman - Linux 命令速查手册
Linux 命令速查手册
|
Unlock
|
Unlock
|
0
|
|
3 years ago | |
Algorithms (VPP compatible)
Explained and Animated
|
Unlock
|
Unlock
|
0
|
|
3 years ago | |
pythoni3.5$-run code,outline,1
Good helper for python Learn
|
Unlock
|
Unlock
|
0
|
|
2 years ago | |
成语小册 - 别具一格的离线成语字典
您的移动成语字典
|
Unlock
|
Unlock
|
0
|
|
4 years ago | |
GreatLearn - 全新的引导式学习方式
让知识更有趣，但仅仅是个开始
|
Unlock
|
Unlock
|
0
|
|
2 years ago | |
UML教程
笔记｜测试
|
Unlock
|
Unlock
|
0
|
|
1 year ago | |
Linux命令手册大全
网管工程师必备
|
Unlock
|
Unlock
|
0
|
|
1 year ago | |
Algorithms HQ
|
Unlock
|
Unlock
|
2
|
|
1 year ago | |
神经网络
在你的设备上训练神经网络
|
Unlock
|
Unlock
|
0
|
|
4 years ago | |
Magainst - Mind Against
Combines games and learning
|
Unlock
|
Unlock
|
0
|
|
2 years ago |
算法导论.助手 Installs
Last 30 days
算法导论.助手 Revenue
Last 30 daysCLRS.Helper Revenue and Downloads
Gain valuable insights into 算法导论.助手 performance with our analytics.
Sign up now to access downloads, revenue, and more.
Sign up now to access downloads, revenue, and more.
App Info
- Category
- Education
- Publisher
- 巍 顾
- Languages
- English, Chinese, Chinese
- Recent release
- 1.8 (2 years ago )
- Released on
- Apr 23, 2021 (3 years ago )
- Also available in
- China , United States , Mexico , Philippines , Peru , New Zealand , Norway , Netherlands , Nigeria , Malaysia , Poland , Lebanon , Kazakhstan , Kuwait , South Korea , Japan , Italy , Pakistan , India , Portugal , Romania , Russia , Saudi Arabia , Sweden , Singapore , Thailand , Türkiye , Taiwan , Ukraine , Vietnam , South Africa , Dominican Republic , Argentina , Austria , Australia , Azerbaijan , Belgium , Brazil , Belarus , Canada , Switzerland , Chile , Colombia , Czechia , Germany , Denmark , United Arab Emirates , Algeria , Ecuador , Egypt , Spain , Finland , France , United Kingdom , Greece , Hong Kong SAR China , Hungary , Indonesia , Ireland , Israel
- Last Updated
- 2 months ago
This page includes copyrighted content from third parties, shared solely for commentary and research in accordance with fair use under applicable copyright laws. All trademarks, including product, service, and company names or logos, remain the property of their respective owners. Their use here falls under nominative fair use as outlined by trademark laws and does not suggest any affiliation with or endorsement by the trademark holders.