01 lesson-1-1-1-hashing-introduction (18.97 MB)
02 lesson-1-1-2-hashing-hash-function (59.26 MB)
03 lesson-1-1-3-hashing-hash-function-examples (31.69 MB)
04 lesson-1-1-4-collision-handling-i-separate-chaining (25.55 MB)
05 lesson-1-1-5-collision-handling-ii-probing-and-double-hashing (54.67 MB)
06 lesson-1-1-6-hashing-analysis (27.68 MB)
07 lesson-1-1-7-hash-tables-in-c (12.37 MB)
01 2-1-1-disjoint-sets-introduction (25.69 MB)
03 2-1-2-disjoint-sets-naive-implementation (24.02 MB)
04 2-1-3-disjoint-sets-uptrees-a-better-implementation (30.99 MB)
05 2-1-4-uptrees-simple-running-time (20.4 MB)
06 2-1-5a-uptrees-smart-union-path-compression-i (41.95 MB)
07 2-1-5b-uptrees-smart-union-path-compression-ii (26.43 MB)
01 3-1-1-graphs-introduction (35.04 MB)
02 3-1-2-graphs-vocabulary (40.24 MB)
03 3-1-3-graphs-edge-list-implementation (19.57 MB)
04 3-1-4-graphs-adjacency-matrix-implementation (27.3 MB)
05 3-1-5-graphs-adjacency-list-implementation (33.69 MB)
01 4-1-1-graphs-bfs-traversal (36.66 MB)
02 4-1-2-graphs-bfs-analysis (52.83 MB)
03 4-1-3-graphs-dfs-traversal (40.84 MB)
01 4-2-1-minimum-spanning-trees-mst-introduction (15.17 MB)
02 4-2-2-mst-kruskals-algorithm-i (29.25 MB)
03 4-2-3-mst-kruskals-algorithm-ii (24.31 MB)
04 4-2-4-mst-prims-algorithm (46.53 MB)
01 4-3-1-graphs-dijkstras-algorithm (25.96 MB)
02 4-3-2-graphs-dijkstras-edge-cases (33.78 MB)
03 4-3-3-graphs-dijkstras-running-time (11.51 MB)
04 4-3-4-graphs-landmark-path-problem (35.25 MB)