Version history
CLRS.Helper[Lite]
35
ASO score
Text
41/100
Reviews
0/100
Graphic
60/100
Other
0/100
App Rating
5
Votes
2
App Age
4y 7m
Last Update
Jun 27, 2022
Compare with Category Top Apps
|
Metrics
|
Current App
|
Category Top Average
|
Difference
|
|---|---|---|---|
|
Rating
|
5
|
4.59
|
+9%
|
|
Number of Ratings (Voted)
|
2
|
1M
|
-100%
|
|
App Age
|
4y 7m
|
7y 11m
|
-42%
|
|
In-app Purchases Price
|
$0
|
$53
|
|
|
Update Frequency
|
1266d
|
19d
|
+6 399%
|
|
Title Length
|
17
|
27
|
-37%
|
|
Subtitle Length
|
25
|
28
|
-11%
|
|
Description Length
|
2 055
|
3 025
|
-32%
|
|
Number of Screenshots
|
702
|
1298
|
-46
%
|
|
Size
|
27MB
|
239MB
|
-89
%
|
Category Ranking in United States
7 days
Last 7 days
Last 30 days
Last 90 days
Last 180 days
Last year
| 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 |
|---|
Analyze this and other apps using Asolytics tools
Text ASO
Title
(
Characters:
17
of 30
)
CLRS.Helper[Lite]
Subtitle
(
Characters:
25
of 30
)
A tool for studying CLRS
Description
(
Characters:
2055
of 4000
)
Refer to The third edition of the book, covering content [need full version]:
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
Other
Additional Information
| Rating: | |
| Voted: | 2 |
| App Store Link: | |
| Website: | - |
| Email: | - |
| Privacy Policy: | |
| Categories: | Education |
| Size: | 27MB |
| App Age: | 4 years 7 months |
| Release Date: | May 07, 2021 |
| Last Update: | Jun 27, 2022 |
| Version: | 1.5 |
Version history
1.5
Jun 27, 2022
Added: descriptions of Insert Sort and Merge Sort in Ch02;
1.4
Feb 19, 2022
Improved: simplify operations;