CLRS.Helper

🇺🇸 United States
巍 顾  | 
47
ASO score
Text
45/100
Reviews
50/100
Graphic
60/100
Other
0/100
rating
App Rating
4.9
rating
Votes
4
rating
App Age
4y 8m
rating
Last Update
Jun 27, 2022

Compare with Category Top Apps

Metrics
Current App
Category Top Average
Difference
Rating
4.84
4.59
+5%
Number of Ratings (Voted)
4
1M
-100%
App Age
4y 7m
7y 10m
-41%
Price
$1
$1
+98%
In-app Purchases Price
$0
$52
Update Frequency
1266d
20d
+6 281%
Title Length
11
27
-59%
Subtitle Length
25
28
-11%
Description Length
2 035
2 982
-32%
Number of Screenshots
2106
1322
+59 %
Size
43MB
232MB
-81 %

Category Ranking in United States

All
New
Trending Up
Trending Down
Top Dec 06, 2025 Dec 13, 2025
No results were found!
Top Dec 06, 2025 Dec 13, 2025
No results were found!
Top Dec 06, 2025 Dec 13, 2025
No results were found!
Top Dec 06, 2025 Dec 13, 2025
No results were found!

Ranking Keywords in United States

Keywords App Rank
Illustration
Analyze this and other apps using Asolytics tools

Text ASO

Title (
Characters: 11 of 30
)
CLRS.Helper
Subtitle (
Characters: 25 of 30
)
A tool for studying CLRS
Description (
Characters: 2035 of 4000
)
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;}
Read more

Visual ASO

Screenshots

Rating & Reviews

Reviews Overview
🧐 Coming Soon…
Rating
4.9
4 voters

Some Latest Reviews

Other

Additional Information
Rating:
4.85
Voted: 4
App Store Link:
Price: 0.99 $
Website: -
Email: -
Privacy Policy:
Categories: Education
Size: 43MB
App Age: 4 years 8 months
Release Date: Apr 23, 2021
Last Update: Jun 27, 2022
Version: 1.8
Version history
1.8
Jun 27, 2022
Added: descriptions of Insert Sort and Merge Sort in Ch02;
1.7
Feb 19, 2022
Fixed: Ch15-Longest common subsequence,crash-error caused by rotating screen; Fixed: Ch25-The Floyd-Warshall algorithm,π matrix got wrong value; Improved: simplify operations;
Version history