Algorithms HQ vs Data Structure Display

A fun and didactic app to learn computer science algorithms! See how algorithms are working by watching an animation of their execution. Understand how data is manipulated as it is animated through an intuitive representation of its contents. Always know which line is executed in the pseudo-code, what are the values of the variables. Need to quickly refresh your memory? Just use the app as a quick reference on the main characteristics of each algorithm! Main features: - Execute a single instruction, or undo the previous one - Run, or rewind the algorithm until you decide to pause the execution - Adjust the speed of the animation - Best and worst case input data for sorting algorithms - Change the input data: size (up to 500), maximum value or data distribution (random, sorted, many duplicates, etc.) - For data structures, choose the next function to execute, or let a scenario choose for you, so you can see how the data structure evolves. - Landscape or portrait orientation This version contains the following algorithms: Linear Data Structures: - Linked Lists, including a view on memory - Queue - Stack Sorting algorithms: - Bubble Sort - Cocktail Sort - Gnome Sort - Insertion Sort - Quick Sort - Selection Sort More algorithms and more features are on the way!

A novel data structure learning app, the most significant feature is that you can dynamically debug the data structure in this app, and visually observe the changes in the data structure during the operation. In this app you can learn the following data structures: 1. Linear structures, including arrays, linked lists, queues, stacks. Linear structures are the basis for other advanced data structures, as fine as advanced algorithms. 2. Tree structures, including binary tree, binary search tree, AVL tree, red-black tree, and heap. In this app, you can dynamically debug three traversals of the binary tree (including non-recursive traversal implementations), searching in the tree, balance adjustments in the AVL tree and red-black tree, and heap sorting. Give you the ability of handwritten red-black trees. 3. Graph structure, including the adjacency list storage representation of the graph structure, depth-first search and breadth-first search, finding the Euler path in the graph, topological sorting, maximum connected components, minimum spanning tree problem, and shortest single source Path problem. It also provides dynamic debugging of these classic graph algorithms. 4. The data structure introductory class will talk about the problem of the Tower of Hanoi. The algorithm that solves this problem is often recursive. This app provides dynamic debugging of the Tower of Hanoi problem, so you can no longer be confused about the recursive calls of the Tower of Hanoi.