Interview Prep: Merge Sort

4.5 Average Customer Rating

Master the classic programming sorting algorithm

  • 7 Videos
  • 0 hours 40 minutes
  • 66 Happy Students

About the course

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

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

Project

I encourage students of this class to write their own merge sort algorithm. It’s not mandatory, but helps internalize the information I present.

In the code chapter of the course, I provide some points of interest. Coding these provide a deeper understanding of the algorithm.

  • 7 Videos
  • 0 hours 40 minutes
  • 66 Happy Students

Courses Outline

Lesson 1: Merge Sort Algorithm
Free
Introduction
1:09
Divide
4:54
Combine
7:43
Complexity: Divide
6:01
Complexity: Merge
6:39
Stable Sort
2:21
Code
11:29
  • 7 Videos
  • 0 hours 40 minutes
  • 66 Happy Students