投稿

普林斯顿算法课程（Robert Sedgewick ）第一部分中英字幕全

5.3万

94

2019-04-27 10:16:09

来自公开课https://www.coursera.org/learn/algorithms-part1 本课程涵盖了每位认真的程序员需要了解的有关算法和数据结构的基本信息，重点介绍Java实现的应用程序和科学性能分析。第一部分包括基本数据结构，排序和搜索算法。第二部分侧重于图形和字符串处理算法。

计算机科学

fengyuzhesjz 发消息

颗秒！AI生成插画让文案更生动

1 - 1 - Course Introduction (922)

09:23

2 - 1 - Dynamic Connectivity (10-22)

10:23

2 - 2 - Quick Find (10-18)

10:19

2 - 3 - Quick Union (7-50)

07:51

2 - 4 - Quick-Union Improvements (13-02)

13:04

2 - 5 - Union-Find Applications (9-22)

09:23

3 - 1 - Analysis of Algorithms Introduction (814)

08:16

3 - 2 - Observations (1005)

10:06

3 - 3 - Mathematical Models (1248)

12:49

3 - 4 - Order-of-Growth Classifications (1439)

14:40

3 - 5 - Theory of Algorithms (1135)

11:36

3 - 6 - Memory (811)

08:12

4 - 1 - Stacks (1624)

16:25

4 - 2 - Resizing Arrays (956)

09:57

4 - 3 - Queues (433)

04:34

4 - 4 - Generics (926)

09:27

4 - 5 - Iterators (716)

07:17

4 - 6 - Stack and Queue Applications (1325) (optional)

13:25

5 - 1 - Sorting Introduction (1443)

14:44

5 - 2 - Selection Sort (659)

07:00

5 - 3 - Insertion Sort (928)

09:29

5 - 4 - Shellsort (1048)

10:48

5 - 5 - Shuffling (739)

07:40

5 - 6 - Convex Hull (1350)

13:51

6 - 1 - Mergesort (2354)

23:54

6 - 2 - Bottom-up Mergesort (3-20)

03:21

6 - 3 - Sorting Complexity (9-05)

09:06

6 - 4 - Comparators (6-43)

06:44

6 - 5 - Stability (5-39)

05:40

7 - 1 - Quicksort (1933)

19:34

7 - 2 - Selection (708)

07:09

7 - 3 - Duplicate Keys (1125)

11:26

7 - 4 - System Sorts (1150)

11:51

8 - 1 - APIs and Elementary Implementations (1252)

12:53

8 - 2 - Binary Heaps (2336)

23:37

8 - 3 - Heapsort (1429)

14:30

8 - 4 - Event-Driven Simulation (2238) (optional)

22:39

9 - 1 - Symbol Table API (2130)

21:31

9 - 2 - Elementary Implementations (903)

09:04

9 - 3 - Ordered Operations (626)

06:27

9 - 4 - Binary Search Trees (1956)

19:58

9 - 5 - Ordered Operations in BSTs (1031)

10:32

9 - 6 - Deletion in BSTs (952)

09:54

10 - 1 - 2-3 Search Trees (1655)

16:56

10 - 2 - Red-Black BSTs (3530)

35:31

10 - 3 - B-Trees (1036) (optional)

10:38

11 - 1 - 1d Range Search (851)

08:53

11 - 2 - Line Segment Intersection (546)

05:48

11 - 3 - Kd-Trees (2907)

29:08

11 - 4 - Interval Search Trees (1347)

13:48

11 - 5 - Rectangle Intersection (810)

08:12

12 - 1 - Hash Functions (1813)

18:04

12 - 2 - Separate Chaining (728)

07:29

12 - 3 - Linear Probing (1437)

14:38

12 - 4 - Hash Table Context (1009)

10:10

12 - 5 - Symbol Table Applications Sets (504) (optional)

05:05

12 - 6 - Symbol Table Applications Dictionary Clients (540) (optional)

05:40

12 - 7 - Symbol Table Applications Indexing Clients (857) (optional)

07:54

12 - 8 - Symbol Table Applications Sparse Vectors (741) (optional)

07:42

index

01:19

顶部