Algoizer

Algoizer helps students of computer science to understand a few common data structures and basic algorithms with the help of interactive examples and step-by-step visualization of procedures. The application allows a user to walkthrough a pseudocode using prebuilt examples or custom made ones. An in-app tutorial is also included to learn to use the application.

This is the list of included algorithms and data structures.

Sorting Algorithms

- Bubble Sort

- Selection Sort

- Insertion Sort

- Merge Sort

- Quick Sort

Trees

- Binary Search Tree

- AVL Tree

Graphs

- BFS

- BFS-based Connected Components

- DFS

- DFS-based Connected Components

- Dijkstra's Single Source Shortest Path

- Bellman-Ford's Single Source Shortest Path

- Prim's Minimum Spanning Tree

- Kruskal's Minimum Spanning Tree