【普林斯顿】Algorithms, Part I(Princeton University)(中英字幕)【完】

1.4万
7
2019-06-18 04:59:28
165
73
888
36
转自:Princeton University --------------------------------- 大名鼎鼎的「普林斯顿算法」课程! 《算法 I 》由普林斯顿大学「Robert Sedgewick」教授与「Kevin Wayne」教授讲授,该课程涵盖计算机系学生、程序员应该掌握的基础算法与数据结构。 ---------------- > 课程教材:《算法(第4版)》 --------------------------------- 版权:Princeton University
视频选集
(5/60)
0.1.1 - Algorithms Part I with Robert Sedgewick and Kevin Wayne
01:19
0.1.2 - Course Introduction
09:24
1.5.1 - Dynamic Connectivity
10:23
1.5.2 - Quick Find
10:20
1.5.3 - Quick Union
07:51
1.5.4 - Quick Union Improvements
13:04
1.5.5 - Union Find Applications
09:23
1.4.1 - Analysis of Algorithms Introduction
08:16
1.4.2 - Observations
10:07
1.4.3 - Mathematical Models
12:49
1.4.4 - Order-of-Growth Classifications
14:40
1.4.5 - Theory of Algorithms
11:36
1.4.6 - Memory
08:12
1.3.1 - Stacks
16:25
1.3.2 - Resizing Arrays
09:57
1.3.3 - Queues
04:35
1.3.4 - Generics
09:28
1.3.5 - Iterators
07:18
1.3.6 - Stack and Queue Applications
13:25
2.1.1 - Sorting Introduction
14:44
2.1.2 - Selection Sort
07:00
2.1.3 - Insertion Sort
09:30
2.1.4 - Shell Sort
10:48
2.1.5 - Shuffling
07:41
2.1.6 - Convex Hull
13:51
2.2.1 - Merge Sort
23:54
2.2.2 - Bottom-up Merge Sort
03:22
2.2.3 - Sorting Complexity
09:06
2.2.4 - Comparators
06:44
2.2.5 - Stability
05:40
2.3.1 - Quicksort
19:34
2.3.2 - Selection
07:09
2.3.3 - Duplicate Keys
11:26
2.3.4 - System Sorts
11:51
2.4.1 - APIs and Elementary Implementations
12:54
2.4.2 - Binary Heaps
23:37
2.4.3 - Heapsort
14:30
2.4.4 - Event-Driven Simulation
22:40
3.1.1 - Symbol Table API
21:31
3.1.2 - Elementary Implementations
09:04
3.1.3 - Ordered Operations
06:27
3.2.1 - Binary Search Trees
19:58
3.2.2 - Ordered Operations in BSTs
10:32
3.2.3 - Deletion in BSTs
09:54
3.3.1 - 2−3 Search Trees
16:56
3.3.2 - Red-Black BSTs
35:31
3.3.3 - B-Trees
10:38
3.3.4 - 1d Range Search
08:53
3.3.5 - Line Segment Intersection
05:48
3.3.6 - Kd-Trees
29:08
3.3.7 - Interval Search Trees
13:48
3.3.8 - Rectangle Intersection
08:12
3.4.1 - Hash Functions
18:04
3.4.2 - Separate Chaining
07:29
3.4.3 - Linear Probing
14:38
3.4.4 - Hash Table Context
10:11
3.5.1 - Sets
05:05
3.5.2 - Dictionary Clients
05:40
3.5.3 - Indexing Clients
07:54
3.5.4 - Sparse Vectors
07:42
客服
顶部
赛事库 课堂 2021拜年纪