Merge Sort Visualization

Divide and conquer algorithm that divides the array into halves, sorts them, and merges them back together.

Step: 0 / -1

Speed

1function mergeSort(arr, left, right)

2 if left >= right: return

3 mid = left + (right - left) / 2

4 mergeSort(arr, left, mid)

5 mergeSort(arr, mid + 1, right)

6 merge(arr, left, mid, right)

Best CaseO(n log n)

Average CaseO(n log n)

Worst CaseO(n log n)