Merge Sort Algorithm | How Merge Sort Works (Example Diagram) | Part - 1 | Sorting Algorithms - DSA

Understand or Merge Sort sorting algorithm works with easy example & visual diagram. We will dry run the merge sort algorithm step by step by taking a diagram example to understand the flow of the algorithm at every step.
Theory -
1. Merge Sort is a Divide and Conquer algorithm.
2. It divides input array in two halves, calls itself for the two halves(recursively) and then merges the two sorted halves.
3. A separate merge() function is used for merging two halves.
4. Merge sort is one of the most efficient sorting algorithms.
5. Time Complexity: O(nlog(n))
---------------------------------------------------------------------------------------------
Full DSA playlist -    • Introduction to Data Structures & Alg...  
Full Code & Theory article - https://simplesnippets.tech/merge-sor...
C++ Programming Tutorials for Beginners Course -    • Introduction to Computer Programming ...  
---------------------------------------------------------------------------------------------
Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
---------------------------------------------------------------------------------------------
Simple Snippets Official Website -
http://simplesnippets.tech/
Simple Snippets on Facebook -
  / simplesnippets  
Simple Snippets on Instagram -
  / simplesnippets  
Simple Snippets on Twitter -
  / simplesnippet  
Simple Snippets Google Plus Page -
https://plus.google.com/+SimpleSnippets
Simple Snippets email ID -
[email protected]

For More Technology News, Latest Updates and Blog articles visit our Official Website - http://simplesnippets.tech/
#mergesort #sortingalogrithms #dsa #divideandconcquer #algorithms