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];
6. Heapsort: Heapsort;
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, Maxmum 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];
16. Greedy Algorithms: Acitivity selection[Recursive, Iterative];
22. Elementary Graph: Breadth-first search, Depth-first search, Topological sort, Strongly connected components;

The primary features:
You can run the pseudo-code single step or continuous, observe the change of parameters and data structures at the same time;
You can set breakpoints in program and ovserve the status of running program, it can help you to understand the design thought of the algorithm;
With running-time function stacks and the returning breakpoints，you can track the running process of recursive functions easily;
By recording the executing times of the pseudo-codes can help you to understand the running time of algorithms;

I wish this app can be helpful to you;