Merge Sort Explained

Показать описание

Merge sort is a very popular sorting algorithm used to sort lists while providing a consistent run time and stability. It is a prime example of divide and conqueror algorithm. We'll see how to break down a popular sorting algorithm into a recursive problem.

References/Additional Resources:
Merge Sort Overview

You can find the repo for this video at

You can find the repository the tool used to create this video at

Social:

Consider support me on Patreon:

0:00 Introduction
0:08 What Is Merge Sort?
0:19 Merge Sort In Action
1:01 How it works
2:04 Merge Sort Runthrough
3:17 Average Case Runthrough
3:41 Runtimes Comparsions and Stability
3:55 Sorts Comparsion
5:04 Merge Sort Summary

#johnsong #johnsongnow #sorting