Merge Sort Algorithm: Understanding & Implementation

A Programming and Interview Preparation Class by Edaqa Mortoray

Sorting is a key activity in programming, and you should understand how it works. Merge sort is a common approach. By learning this algorithm, you’ll improve your understanding of sorting. It serves as a cornerstone to your algorithmic knowledge, helping you in your job, and improving your interview performance.

In this class, we’ll look at:

  • How the merge sort algorithm works
  • The time and space complexity
  • An implementation coded in Python

Ask questions and I’ll do my best to answer. I’m here to support you.

For further instruction on programming and interview preparation, check out A site I created to refresh your knowledge and help you succeed at interviews.

The code I use for the final chapter can be found in my GitHub repository.

🎓 Levels: Beginner
Basic coding experience in any language required

⏱ Running Time: 40m

Enroll on SkillShare

Edaqa is an avid teacher with many years of experience in programming and animation. Join the thousands of people who have already benefited from his writing, live streams, and videos.