Merge Sort: Top-Down and Bottom-Up

preview_player
Показать описание
Table of Contents:

00:00 - Introduction and Prerequisites
00:30 - Merging Lists
01:22 - Algorithm Concept
02:26 - Standard Recursive (Top-Down) Merge Sort
03:38 - Analysis
04:13 - Optimizations
08:50 - Naive Parallelization
11:26 - Unwinding the Recursion
12:20 - Iterative (Bottom-Up) Merge Sort
13:32 - Comparison to Top-Down (8 elements)
15:27 - Comparison to Top-Down (13 elements)
18:30 - A Different Optimization
19:32 - Timsort Ideas
Рекомендации по теме
Комментарии
Автор

At 12:34 - 13:44 the first line should say "merge 17 with -22: compare (17, -22)." Same with the first line of the "Unwinding the Recursion" panel.

lukebrouwer
Автор

The visualizations combined with your explanations really make the whole process easy to understand. Thank you for this

machripe
Автор

Nice explanation of iterative bottom up! I've been researching for a few days now, and you explained it so clearly in just a few minuets. Edit: This is so helpful. I can't believe it doesn't have more views

kcreview
Автор

Wow. This really clarified a lot of different things about mergesort for me. Thank you for this!

mutatedllama
Автор

Nice explanation with great animation!

arajkhandelwal
Автор

I can’t wait to meet you at SJSU soon David Scot Taylor!

HenryFanLearningScience