How merge sort works

Let us see how merge sort works

🎯 Goal:

You have a bunch of numbers (or toys) in random order, and you want to put them in order from smallest to biggest.

Example: 👉 8, 3, 5, 4, 7, 6, 1, 2

🧩 Step 1: Break them into small pieces

The pile looks messy and too big to handle. So, you keep splitting it in half — again and again — until each group has just one number.

It’s like:

8, 3, 5, 4, 7, 6, 1, 2
→ [8, 3, 5, 4]   [7, 6, 1, 2]
→ [8, 3] [5, 4]   [7, 6] [1, 2]
→ [8] [3] [5] [4] [7] [6] [1] [2]

Now each tiny group (like [8] or [3]) is already sorted because it has only one number.

⚙️ Step 2: Start joining back — but in order

Now we merge the small groups together in sorted order.

For example:

• [8] and [3] → compare → becomes [3, 8]
• [5] and [4] → becomes [4, 5]
• [7] and [6] → becomes [6, 7]
• [1] and [2] → becomes [1, 2]

Now we have:

[3, 8] [4, 5] [6, 7] [1, 2]

🔁 Step 3: Keep merging until one list remains

Merge again:

• [3, 8] and [4, 5] → compare each → [3, 4, 5, 8]
• [6, 7] and [1, 2] → [1, 2, 6, 7]

Now merge those two:

• [3, 4, 5, 8] and [1, 2, 6, 7] → [1, 2, 3, 4, 5, 6, 7, 8] 🎉

💡 Easy way to remember

Think of it like sorting puzzle pieces:

1. Break the big messy puzzle into tiny pieces.
2. Solve small parts first (easy!).
3. Join small solved parts into bigger ones — always keeping order.

When all are joined — you get the full sorted puzzle.

🌟 Why it’s smart

Merge sort is great because it never gets stuck — it always works by dividing and combining, like teamwork.