Path Finding Visualization vs Algo Viewer

Want to see various pathfinding algorithms in action? With Path Finding Visualization, you can visualize, in action, six different algorithms. This app allows you to select your own starting and ending points, select the algorithm you want to use, and add walls in order to create boundaries. This app includes the following algorithms: Dijkstra's - Works by expanding outwards until it reaches the target node. Guaranteed to find the shortest path as long as there are not any negative weights. Bidirectional Dijkstra's - Dijkstra's algorithm from both sides. A* - Like Dijkstra's in that it favors nodes close to the starting point, but also favors nodes close to the ending point (heuristic). It does not guarantee the shortest path. A tie-breaker that prefers straight lines was included in order to prevent multiple nodes from having the same F values. Bidirectional A* - The A* algorithm from both sides. Breadth-First Search - Traverses through a graph one level at a time until it finds the target node. Since there are no weights, this algorithm does guarantee the shortest path. Depth-First Search - Traverses through a graph by going as deep as possible and then backtracking until it finds the target node. It does not guarantee the shortest path. Learning about or want to visualize any of the above algorithms in action? Download Path Finding Visualization today and have a better understanding of how each algorithm works.

AlgoViewer helps you understand algorithms the way they were meant to be understood — by watching them work, step by step. Whether you're a CS student studying for exams, a developer preparing for technical interviews, or just someone curious about how sorting, searching, and graph traversal actually work, this app breaks it down visually so it clicks. WHAT'S INSIDE 40 algorithms and data structures across 6 categories: • Search — Linear, Binary, Interpolation, Jump, Exponential • Sorting — Bubble, Selection, Insertion, Merge, Quick, Heap, Shell, Counting, Radix • Linear Data Structures — Stack, Queue, Deque, Linked List, Doubly Linked List, Circular Linked List • Non-Linear Data Structures — Binary Tree, Binary Search Tree, AVL Tree, Heap, Hash Table • Graphs — BFS, DFS, Dijkstra, Prim, Kruskal, Bellman-Ford, Floyd-Warshall • Math — Factorial, Fibonacci, GCD, LCM, Sieve of Eratosthenes, Prime Factorization, Fast Exponentiation, Catalan Numbers • Home Screen and Lock Screen widgets: a new Algorithm of the Day every day, plus your streak and progress. HOW IT WORKS 1. Pick an algorithm 2. Enter your own data or use random values 3. Tap play and watch each step unfold with color-coded animations 4. Read the explanation to understand the "why" behind each step 5. Check out the code — every algorithm includes examples in Swift, Python, and Java BUILT FOR LEARNING • Step-by-step animations you can pause, step through, and speed up • Detailed explanations with complexity analysis and real-world use cases • Code examples in 3 languages with copy support • Time complexity charts so you can see how algorithms scale • Quizzes for every algorithm to test what you learned • Your progress, achievements, and favorites sync with iCloud • Light and dark mode • Available in English and Spanish FREE TO START, ONE-TIME UNLOCK 17 algorithms are free, forever. Unlock all 40 with a single one-time purchase: no subscriptions and no ads. Built with care by a developer who believes the best way to learn an algorithm is to see it in action.