Merge sort animated: runs split, then merge back as the smaller head wins each comparison — with lo/mid/hi pointers, counters, and pseudocode.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Merge Sort Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Merge sort animated: runs split, then merge back as the smaller head wins each comparison — with lo/mid/hi pointers, counters, and pseudocode. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Quick Sort Visualizer: Quick sort animated: pivot highlighted, smaller values swapped into the left zone, pivot placed between — with i/p pointers, verdicts, and pseudocode.
Open toolHeap Sort Visualizer: Heap sort animated: build the max-heap, swap the root to the end, sift down — every comparison colored TRUE/FALSE with live pseudocode.
Open toolSorting Algorithm Visualizer: Watch bubble, selection, insertion, merge, quick, and heap sort run step by step — animated bars, comparison and write counters, plain-English narration, and complexity cards.
Open tool1Merging [0,1) with [1,2): is left head 53 ≤ right head 100? TRUE — take left.
mergeSort(lo, hi):recurse on both halvescopy the two runs to scratchwhile both runs have items:write the smaller head into a[k]run merged
Splits the array in halves, sorts each, then merges two sorted runs by repeatedly taking the smaller head. Guaranteed n log n.
