28:47

An In-Depth Algorithmic Analysis of Bubble Sort. Best Case, Average Case, & Worst Case.

36:50

Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.

27:05

Maximum Sum Rectangle In A 2D Matrix - Kadane's Algorithm Applications (Dynamic Programming)

13:12

3 Types of Algorithms Every Programmer Needs to Know

18:56

1.11 Best Worst and Average Case Analysis

20:19

Implement A Binary Heap - An Efficient Implementation of The Priority Queue ADT (Abstract Data Type)

30:40

Insertion Sort Algorithm - Theory + Code

40:18

Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.