Скачать или смотреть Merge Sort Step-by-Step Dry Run| DSA Python | Nidhi Chouhan

Learn how to *sort an array in Python* using the **Merge Sort algorithm**! 🐍

Merge Sort is a *Divide and Conquer* algorithm that recursively splits an array, sorts the halves, and merges them back into a sorted array. It works efficiently for large datasets and is a **stable sorting algorithm**.

🔹 What you'll learn in this video:
1. Step-by-step dry run of Merge Sort
2. How the divide and merge steps work
3. Handling left and right subarrays
4. How leftover elements are added using extend()
5. Time & space complexity of Merge Sort

📌 Example Dry Run:

Input: [4, 2, 1]
Step 1: Divide → [4] and [2,1]
Step 2: Sort [2,1] → [1,2]
Step 3: Merge [4] and [1,2] → [1,2,4] ✅

Input: [2,5] and [1,4]
Merge → [1,2,4,5] ✅

💡 Key Points:
Compares elements from left and right subarrays
Adds remaining elements after one side is exhausted
Efficient and stable sorting

📌 GitHub Repository (Code + Notes):
👉 https://github.com/dearnidhi/DSA-2025

📩 Contact:
✉️ Email: [email protected]
📸 Instagram: @codenidhi

✨ Don’t forget to LIKE 👍, SHARE 📢 & SUBSCRIBE 🔔 for more DSA and LeetCode tutorials!

#codenidhi #nidhichouhan #MergeSort #SortArray #Python #DSA #AlgorithmTutorial #DivideAndConquer