Sorting is used in a lot of computer applications and to solve programming problems. Merge sort is a really popular sorting algorithm that uses the Divide and Conquer algorithmic paradigm. As per the name, this method requires some kind of merging. But what do you need to merge, and on what criteria do you perform this merge? In this video I perform a live demo to show you behind the scenes of Merge Sort, and then do a step by step walkthrough of the code to do a dry-run.
00:00 - Intro
01:00 - Advantages of Merge Sort
02:31 - Live Demo of Merge Sort
09:44 - Actual implementation and dry-run
15:15 - Final thoughts
📚 Links I talk about in the video:
Bubble Sort: • Bubble Sort Algorithm ...
Insertion Sort: • Insertion Sort visuali...
Selection Sort: • Selection Sort | Live ...
Divide and Conquer Algorithm: • Divide and Conquer alg...
Code on Github: github.com/nikoo28/java-solut...
📘 A text based explanation is available at: studyalgorithms.com/array/mer...
🔗 To see more videos like this, you can show your support on: www.buymeacoffee.com/studyalg...
💻 Get Social 💻
Follow on Facebook at: / studyalgos
Follow on Twitter at: / studyalgorithms
Follow on Tumblr at: / studyalgos
Subscribe to RSS feeds: studyalgorithms.com/feed/
#algorithms #sorting #tutorial