Merge Sort

Merge sort divides a list into halves, sorts them, and merges them back together. It sorts efficiently with 𝑂 ( 𝑛 log ⁡ 𝑛 ) O(nlogn) time complexity.

Scroll down

Quick Sort

Array

Merge Sort

Merge Sort Operation

Create a size N =

Start Sorting

Click an Operation to view the Merge Sort