DSA Visualizer

EdgeWorks

Contains ads

About this app

Learn Data Structures and Algorithms through interactive, step-by-step visualizations.

DSA Visualizer lets you play, pause and step through algorithms one move at a time. Each step comes with a short explanation, the matching line of pseudocode, and running counters such as comparisons or swaps. It is useful for learning, revision and interview preparation.

What you can learn
The app covers 85+ algorithms and data structures across 16 topics:

Concepts
• Recursion, memoization, greedy choices, backtracking and bitwise operations

Sorting
• Bubble, Selection, Insertion, Merge, Quick and Heap Sort
• Counting, Radix, Bucket and Shell Sort, plus a sorting stability demo

Searching
• Linear Search and Binary Search

Trees
• Inorder, Preorder and Postorder traversals
• Binary search tree operations and AVL rotations
• Segment tree, Fenwick tree, trie and union-find

Graphs
• DFS and BFS (graph, tree and maze views)
• Dijkstra, Bellman-Ford, Floyd-Warshall and A*
• Topological sort, Kruskal and Prim

Dynamic Programming
• Fibonacci, 0/1 knapsack, longest common subsequence, edit distance, coin change and longest increasing subsequence

Problem-solving patterns
• Two pointers, sliding window, prefix sums, monotonic stack and binary search on the answer

Greedy and Divide and Conquer
• Activity selection, Huffman coding, fractional knapsack, closest pair of points, Karatsuba multiplication and quickselect

More topics
• Backtracking: N-Queens, Sudoku and subset sum
• Strings: KMP, Rabin-Karp, Z algorithm, Boyer-Moore and Manacher
• Number theory: GCD, sieve of Eratosthenes and modular exponentiation
• Geometry: convex hull and segment intersection
• Cryptography basics: Caesar, Vigenère, AES, RSA, Diffie-Hellman, elliptic curves, digital signatures, MD5, SHA-256 and HMAC, shown with small example values

Data Structures
• Arrays, linked lists (singly, doubly, circular), stacks and queues that you operate yourself
• Priority queue and hash tables

Learning tools
• Step-by-step playback with pause, step back and a progress scrubber
• Adjustable playback speed
• Plain-language explanation for each step
• Live pseudocode that highlights the current line
• Predict mode: answer a question before the next step is revealed
• Time and space complexity for each algorithm
• Big-O playground that plots operation counts as input size grows
• Compare mode to run two sorting algorithms side by side on the same input
• Colour-coded highlights with a colour-blind friendly option
• Light and dark themes
• Progress tracking and bookmarks

Who it is for
• Computer science students
• Learners preparing for coding interviews
• Developers revising DSA
• Anyone curious about how algorithms work

Privacy and access
• Your progress and bookmarks are stored locally on your device
• No account required
• Lessons work offline; ads need an internet connection
• Contains ads (Google AdMob)

What’s new

What's new in 1.3.0
• 4 new step-by-step walkthroughs: Tarjan's SCC, Edmonds-Karp max flow, LRU cache, and matrix-chain multiplication
• Search every algorithm by name, topic, difficulty or complexity
• Daily challenge: one question a day, build a streak
• New quick intro tour (replay it from Settings)
• DFS & BFS now narrate each step, with prediction quizzes
• New text size setting
• Fix: bottom ad no longer covers the system navigation bar