Big O Notation Series #9: Understanding Merge Sort

Understanding Merge Sort: Deep dive into merge sort, recursion, and its time complexity.

Chapters:
00:00 Intro
01:13 Recursion
08:00 Merge
11:51 Time Complexity: O(n log n)


More from this series:    • Big O For Software Engineering  

merge sort divide and conquer recursive merge sort merge sort algorithm sorting algorithm merge sort code sorting algorithms merge sort animation sorting algorithms visualized sorting algorithms explained merge sort algorithm javascript merge sort algorithm explained merge sort algorithm analysis merge sort algorithm time complexity big o series big o mini series big o notation series big o notation mini series understanding merge sort Join the Discord to talk to me and the rest of the community!
  / discord