Visualized Algorithms for Android – Latest Version & Features

We aim to provide you with an accessible way of understanding algorithms.
It is a common practice to study an algorithm by reading and analyzing the code first and seeing examples later.
This approach decouples, to some extent, the understanding of the algorithms intuitive flow from the rigorous instructions, AKA the pseudocode.
There is a strong connection that can be made between the two and we aim to strengthen it by providing platforms to: 1.
Step through the algorithms pseudocode, line by line, seeing the results of each step simultaneously on the other half of screen, using animation and highlighting techniques.2.
Validate your intuition by running algorithms with simple screen taps and instant feedback.It should be stated that this is not a complete data-structures-and-algorithms course.
We dont provide you with rigorous analysis of algorithms and omit some technical definitions.
It is your responsibility to learn it and can be easily found in books, Wikipedia, university materials etc., rigorous analysis is an important aspect of computer science.
Nevertheless, we do aim to provide you with the intuitive basis for the rigorous analysis to make sense, and for strengthening the connection between the code and its intuitive flow.All the algorithms in the app include a brief description, and a debugger-style step-by-step simulation with a popular pseudocode variation using general examples.
Some algorithms, when appropriate, also have an interactive simulation which lets you run the algorithm yourself on random inputs.
Syllabus:1.
Sorting Algorithms: - Bubble Sort - Insertion Sort - Merge Sort (and the Merge subroutine separately) - Quicksort (and the Partition subroutine separately) - Heapsort in the next section2.
Binary Heaps (Min/Max Heaps focusing on Max Heaps): - Heapify - Build Heap - Increase Key - Insertion - Extract Max - Heapsort3.
Binary Search Trees: - Pre-Order Scan - In-Order Scan - Post-Order Scan - Search - Successor / Predecessor - Insertion - Deletion4.
AVL Trees: - Tree Rotations - Rebalance Operations - Insertion - Deletion5.
Elementary Graph Algorithms: - Breadth First Search - Depth First Search6.
Minimum Spanning Trees: - Prim - Kruskal7.
Single Source Shortest Paths: - Bellman Ford - Dijkstra