|
| 1 | +# Algorithm Visualizer |
| 2 | + |
| 3 | +> Interactive step-by-step visualization of 45 algorithms across five categories. |
| 4 | +
|
| 5 | +## How It Works |
| 6 | + |
| 7 | +1. Select a category and algorithm from the sidebar |
| 8 | +2. The app generates random input and runs the algorithm, recording each step |
| 9 | +3. Steps are animated with color-coded state changes |
| 10 | +4. Complexity panel shows interactive time/space complexity charts |
| 11 | + |
| 12 | +## Features |
| 13 | + |
| 14 | +- Step-by-step animation with configurable speed (Slow/Medium/Fast/Very Fast) |
| 15 | +- Real-time time and space complexity analysis |
| 16 | +- Python code execution in the browser via Pyodide (WebAssembly) |
| 17 | +- HD video export with optional sound |
| 18 | +- Multi-language support (English, French, Arabic with RTL) |
| 19 | +- Google sign-in for saved preferences and favorites |
| 20 | + |
| 21 | +## Algorithm Categories |
| 22 | + |
| 23 | +- **Sorting**: Bubble, Selection, Insertion, Merge, Quick, Heap, Counting, Radix, Shell, Cocktail Shaker, Gnome, Comb, Tim, Bitonic |
| 24 | +- **Pathfinding**: Dijkstra, A*, BFS, DFS, Greedy Best-First, Bidirectional BFS, Jump Point Search, Bellman-Ford |
| 25 | +- **Searching**: Linear, Binary, Jump, Exponential, Ternary, Fibonacci |
| 26 | +- **Tree Traversal**: Pre-order, In-order, Post-order, Level-order, BFS, DFS, Morris In-order |
| 27 | +- **Graph**: BFS, DFS, Topological Sort, Bellman-Ford, Floyd-Warshall, Kruskal, Prim, Tarjan, Kosaraju, Ford-Fulkerson |
| 28 | + |
| 29 | +## Agent Integration |
| 30 | + |
| 31 | +Agents can query algorithm information via MCP server card at https://bayanflow.com/.well-known/mcp.json |
0 commit comments