Simulations Index
Simulations Index
Data Structures
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Circular Doubly Linked List
- Stack Visualization
- Queue Visualization
- Circular Queue
- Deque Visualization
- Priority Queue
- Binary Tree
- Binary Search Tree
- AVL Tree
- Red Black Tree
- Segment Tree
- Fenwick Tree
- Trie Visualization
- Heap Tree
- Hash Table
- Collision Resolution
- Linear Probing
- Chaining Visualization
- LRU Cache
- Skip List
- Disjoint Set Union
- Bloom Filter
- Sparse Table
Sorting Algorithms
Searching Algorithms
Recursion & Backtracking
Dynamic Programming
Pathfinding & Grid Search
Operating Systems
Computer Networking
Databases & Indexing
Compiler Design
Machine Learning
Web Development
System Design
Merge Sort Visualizer
A divide-and-conquer algorithm that recursively splits and merges subarrays.
Steps
0 / 0
System Ready
Array Bar Track
Unsorted
Comparing
Swap
Sorted
Max-Heap Binary Tree Layout
Radix Digit Distribution Buckets (0-9)
Frequency Count Array Bins
Presets
Simulation initialized. Choose settings and click Play to start.
Live Code Tracer
Sorting// Sorting code display...