Free
⭐️5 / 5
Rating
🙌1
Ratings
📼10 scs
Content
📉--70.71%
Price change
📦w/o updates
Updates frequency
🗣❌ unsupported
Your locale
- Versions
- Price History↓
- Description
- FAQ
All Versions of CLRS.Helper
1.8
June 27, 2022
Added: descriptions of Insert Sort and Merge Sort in Ch02;
1.7
February 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;
More1.6
December 4, 2021
Added: Addition-Tower of Hanoi,N Queens Problem,Comparison of sorting algorithms;
More1.5
November 14, 2021
Added: Ch23-Minimum Spanning Trees[Kruskal’s algorithm,Prim’s algorithm];
Added: Ch24-The Bellman-Ford algorithm,DAG algorithm,Dijkstra’s algorithm;
Added: Ch25-All-pairs Shortest Paths[Slow,Faster,The Floyd-Warshall algorithm];
Added: Ch26-The Ford-Fulkerson algorithm;
More1.4
September 15, 2021
Added: Ch06-Min Heap;
Added: Ch15-Longest comman subsequence;
Added: Ch16-Huffman codes;
More1.3
August 16, 2021
Added: Ch04-Matrix Multiplication[normal, recursive, Strassen];
Improved: Support to set breakpoints in programs;
More1.2
June 24, 2021
Added: Ch22-Topological sort & Strongly connected components;
1.1
May 18, 2021
Fixed: some input issues;
1.0
April 23, 2021
Price History of CLRS.Helper
Description of CLRS.Helper
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;
Show less
CLRS.Helper: FAQ
Yes, the CLRS.Helper software is iPad-compatible.
巍 顾 developed the CLRS.Helper app.
The CLRS.Helper app requires iOS 15.0 or later.
CLRS.Helper has a user rating of 5.0.
Education Is The Primary Genre Of The Clrs.helper App.
The current version of the CLRS.Helper app is 1.8.
The date of the last CLRS.Helper update is July 1, 2024.
The CLRS.Helper app was initially released on February 5, 2023.
The CLRS.Helper app is rated 巍 顾: Contains no objectionable material.
CLRS.Helper currently features the following languages: English, Chinese, Chinese.
No, CLRS.Helper is not available on Apple Arcade.
No, CLRS.Helper does not offer in-app purchases.
Unfortunately, CLRS.Helper is not tailored for compatibility with Apple Vision Pro.