非常好
简洁
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?
Yes, CLRS.Helper is completely free and it doesn't have any 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?
CLRS.Helper is free.
-
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 Denmark yet.
Ratings History
CLRS.Helper Reviews
Store Rankings
Ranking History
App Ranking History not available yet
Category Rankings
|
Chart
|
Category
|
Rank
|
|---|---|---|
|
Top Paid
|
|
294
|
CLRS.Helper Competitors
| Name | Downloads (30d) | Monthly Revenue | Reviews | Ratings | Recent release | |
|---|---|---|---|---|---|---|
Data Structure Display
Dynamic Presentation for DS
|
Unlock
|
Unlock
|
0
|
|
7 months ago | |
墨典单词-高效学英语锁屏背单词的必备神器
艾宾浩斯List背单词的首选
|
Unlock
|
Unlock
|
0
|
|
5 months ago | |
Linuxman - Linux 命令速查手册
Linux 命令速查手册
|
Unlock
|
Unlock
|
0
|
|
3 years ago | |
数据结构与算法
程序员的算法宝典-多语言详解
|
Unlock
|
Unlock
|
0
|
|
2 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 | |
GreatLearn - 全新的引导式学习方式
让知识更有趣，但仅仅是个开始
|
Unlock
|
Unlock
|
0
|
|
2 years ago | |
UML教程
|
Unlock
|
Unlock
|
0
|
|
11 months ago | |
Algorithms HQ
|
Unlock
|
Unlock
|
0
|
|
1 year ago | |
神经网络
|
Unlock
|
Unlock
|
0
|
|
4 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
- 4 weeks ago