Charles Leiserson - Lecture 2: Bit Hacks | Mrtzcmp3

Lecture 01: Administrivia/Introduction/Analysis of Algorithms, Insertion Sort, Mergesort

Lecture 02: Asymptotic Notation/Recurrences/Substitution, Master Method

Lecture 03: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication

Lecture 04: Quicksort, Randomized Algorithms

Lecture 05: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort

Lecture 07: Hashing, Hash Functions

Lecture 15: Dynamic Programming, Longest Common Subsequence

Lecture 16: Greedy Algorithms, Minimum Spanning Trees

Lecture 06: Order Statistics, Median

Lecture 12: Skip lists

Lecture 10: Red-black Trees, Rotations, Insertions, Deletions

Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search

Lecture 09: Relation of BSTs to Quicksort/Analysis of Random BST

Lecture 08: Universal Hashing, Perfect Hashing

Lecture 14: Competitive Analysis: Self-organizing Lists

Lecture 25: Advanced Topics (cont.)/Discussion of Follow-on Classes

Lecture 22: Advanced Topics

Lecture 11: Augmenting Data Structures, Dynamic Order Statistics, Interval Trees

Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints

Lecture 23: Advanced Topics (cont.)

Lecture 13: Amortized Algorithms, Table Doubling, Potential Method

Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson

Lecture 24: Advanced Topics (cont.)

Lecture 2: Bit Hacks

Lecture 16: Synchronizing without Locks