1/48
Loading...
🧵Start Merge Sort
Split the array, sort each half, then merge them back to get a fully sorted array.
🔒
Loading...
Split the array, sort each half, then merge them back to get a fully sorted array.
Merge Sort is an algorithm that repeatedly splits an array in half, sorts the smaller pieces, and then merges them back together in order. It's like dividing a deck of cards into piles, sorting each pile, and then combining them back in order.