ខ្មែរ

🧠 Data Structure and Algorithm Visualizers

22 free tools, no sign-up needed.

Array in Memory Visualizer Watch array elements sit side by side in memory, shift on insert and delete, and move when the array grows. Singly Linked List Visualizer See nodes scattered in memory, linked only by their next pointers, and watch every pointer change. Doubly Linked List Visualizer Every node points both ways: watch next and prev pointers change as you insert, delete and reverse. Circular Linked List Visualizer The last node links back to the first: see the circle in memory and how each operation keeps it closed. Stack Visualizer Push and pop values on a stack, last in first out, as an array with a top index or as linked nodes. Queue Visualizer First in, first out: enqueue at the rear, dequeue from the front, and watch the front and rear indexes move. Circular Queue Visualizer A ring buffer reuses every slot: watch front and rear wrap around with (index + 1) mod capacity. Deque Visualizer Add and remove at both ends of a double-ended queue and watch the ring buffer underneath. Binary Heap & Priority Queue Visualizer See the same heap as a tree and as an array while values sift up and down. Hash Table Visualizer Insert, search and delete keys and watch the hash function, the collisions and how they are resolved. Binary Search Tree Visualizer Insert, search and delete keys in a BST and watch the four tree traversals visit every node. BFS and DFS Graph Visualizer Draw a small graph, pick a start node and compare breadth-first and depth-first search. Bubble Sort Visualizer Watch the largest values bubble to the end, one comparison and swap at a time. Selection Sort Visualizer Each pass finds the smallest remaining value and swaps it to the front of the unsorted part. Insertion Sort Visualizer Take the next value as the key and slide it left into the sorted part, like sorting cards in your hand. Merge Sort Visualizer Split the array in half again and again, then merge the sorted halves back together. Quick Sort Visualizer Pick a pivot, move smaller values to its left and bigger ones to its right, then repeat on each side. Heap Sort Visualizer Turn the array into a max-heap, then repeatedly move the largest value to the end. Counting Sort Visualizer Sort small whole numbers without comparing them: count, add up, then place. Radix Sort Visualizer Sort by the last digit, then the next, then the next: after the final pass the numbers are in order. Sorting Algorithm Comparison Run several sorting algorithms on the same data at the same time and watch who wins. Binary Search vs Linear Search Search the same sorted array two ways and count the steps: n for linear search, log₂ n for binary search.

See how data structures and algorithms really work. Watch an array laid out in computer memory, insert and delete nodes in a linked list, push and pop a stack, and follow bubble sort, selection sort, insertion sort, merge sort and quick sort one step at a time.

Every visualizer runs in your browser with play, pause, step and speed controls, the code for each step and the time and space complexity, so it works as a study aid for students and for coding interview practice.

Other tool categories

📄 PDF Tools🖼️ Image Tools✍️ Text Tools💻 Developer Tools🧮 Calculators🔁 Unit Converters🇰🇭 Khmer Tools🎬 Video & Audio Tools