MERGE SORT ALGORITHM | Sorting Algorithm | DSA | GeeksforGeeks

Published: 24 September 2016
on channel: GeeksforGeeks
967,324
7.9k

Merge Sort, a sorting algorithm that works on the divide-and-conquer approach to break down the sorting process into manageable steps. Join us in this video and understand how merge sort recursively divides the input into smaller sub-problems and efficiently sorts elements in a data structure.

📖 Read More About MERGE SORT: https://www.geeksforgeeks.org/merge-s...

-------------------------------------------------------------------------

🔴 DSA Course Playlist:    • DSA Course | Data Structures & Algori...  

🔴 Sorting Algorithms Playlist:    • SORTING ALGORITHMS | Data Structures ...  

🔴 How much Maths is Needed for Programming:    • How Much MATHS is Needed for PROGRAMM...  

🔴 Is DSA & CP enough for Job? :    • Is DSA or CP Enough to Crack a job Du...  

-------------------------------------------------------------------------

📖 Want to Learn more about Data Structures and Algorithms?
Check out our Data Structures and Algorithms - Self Paced Course Now!: https://www.geeksforgeeks.org/courses...


📚 Explore Our Courses: https://practice.geeksforgeeks.org/co...

-------------------------------------------------------------------------

Follow us for more fun, knowledge, and resources:

💬 Twitter-   / geeksforgeeks  
🧑‍💼 LinkedIn-   / geeksforgeeks  
📷 Instagram- https://www.instagram.com/geeks_for_g...
💌 Telegram- https://t.me/s/geeksforgeeks_official

📱 Download GeeksforGeeks' Official App: https://geeksforgeeksapp.page.link/gf...


Related Queries:
DSA course
Data Structures and Algorithms
DSA merge Sort
merge Sort algorithm
Sorting Algorithms
DSA sorting algorithms
working of merge sort algorithm
time complexity of merge sort algorithm
important algorithms for interview


#imergesort #mergesortalgorithm #sortingalgorithms #dsa #algorithms #sorting #datastructuresandalgorithms #sortingelements #divideandconquer #recursion