AlgoVision

Search algorithms

Live Panel Search Studio Sort Studio Compare Lab

Algorithm

Merge Sort⌄

Visualization Speed

SlowFast

●Live Status: Paused

ElementPivot / KeyComparingSorted

Custom Input (CSV)

Pseudocode Language

01function mergeSort(arr, left, right) {
02 if (left >= right) return;
03 const mid = Math.floor((left + right) / 2);
04 mergeSort(arr, left, mid);
05 mergeSort(arr, mid + 1, right);
06 merge(arr, left, mid, right);
07function merge(arr, left, mid, right) {
08 while (i <= mid && j <= right) {
09 if (leftPart[i] <= rightPart[j])
10 arr[k] = leftPart[i++];
11 else arr[k] = rightPart[j++];
12 copy remaining elements;
13 write merged values back to arr;

Current Metrics

Comparisons

0

Swaps / Writes

0

Merge Sort initialized.