CLRS.Helper Читы

CLRS.Helper Взлом 1.8 + Чит Коды

Разработчик: 巍 顾
Категория: Образование
Цена: 99,00 ₽ (Скачать бесплатно)
Версия: 1.8
ID: WeiGu.CLRS-Helper

Скриншоты

Game screenshot CLRS.Helper mod apkGame screenshot CLRS.Helper apkGame screenshot CLRS.Helper hack

Описание

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;

История обновлений

1.8
2022-06-27
Added: descriptions of Insert Sort and Merge Sort in Ch02;
1.7
2022-02-19
Fixed: Ch15-Longest common subsequence,crash-error caused by rotating screen;
Fixed: Ch25-The Floyd-Warshall algorithm,π matrix got wrong value;
Improved: simplify operations;
1.6
2021-12-04
Added: Addition-Tower of Hanoi,N Queens Problem,Comparison of sorting algorithms;
1.5
2021-11-14
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;
1.4
2021-09-15
Added: Ch06-Min Heap;
Added: Ch15-Longest comman subsequence;
Added: Ch16-Huffman codes;
1.3
2021-08-16
Added: Ch04-Matrix Multiplication[normal, recursive, Strassen];
Improved: Support to set breakpoints in programs;
1.2
2021-06-24
Added: Ch22-Topological sort & Strongly connected components;
1.1
2021-05-18
Fixed: some input issues;
1.0
2021-04-23

Скачать CLRS.Helper на iPhone и Андроид бесплатно

Скачать на Андроид

Способы взлома CLRS.Helper

Скачать взломанный APK файл

Скачать CLRS.Helper MOD APK
Запросить взлом