普林斯顿大学丨算法第四版 Princeton University 丨 Algorithms Part 1
原地址：https://www.coursera.org/learn/algorithms-part1
教材：Algorithms,Fourth Edition 算法 第四版
algorithm part 2：av89772496
视频选集
（2/59）
01_course-introduction 课程介绍
09:23
01_dynamic-connectivity 动态连通性
10:23
02_quick-find 快速查找
10:20
03_quick-union 快速合并
07:51
04_quick-union-improvements 快速合并改进
13:04
05_union-find-applications 快速合并应用
09:23
01_analysis-of-algorithms-introduction 算法分析介绍
08:16
02_observations 观察
10:07
03_mathematical-models 数学模型
12:49
04_order-of-growth-classifications 增长数量级的分类
14:40
05_theory-of-algorithms 算法原理
11:36
06_memory 内存
08:12
01_stacks 堆栈
16:25
02_resizing-arrays 调整数组
09:57
03_queues 队列
04:35
04_generics 泛型
09:28
05_iterators 迭代
07:18
06_stack-and-queue-applications-optional 堆栈和队列的应用与选择
13:25
01_sorting-introduction 排序介绍
14:44
02_selection-sort 选择排序
07:00
03_insertion-sort 插入排序
09:30
04_shellsort 希尔排序
10:48
05_shuffling
07:41
06_convex-hull
13:51
01_mergesort 归并排序
23:54
02_bottom-up-mergesort 自底向上归并排序
03:22
03_sorting-complexity 排序算法的复杂度
09:06
04_comparators
06:44
05_stability
05:40
01_quicksort
19:34
02_selection
07:09
03_duplicate-keys
11:26
04_system-sorts
11:51
01_apis-and-elementary-implementations
12:54
02_binary-heaps
23:37
03_heapsort
14:30
04_event-driven-simulation-optional
22:40
01_symbol-table-api
21:31
02_elementary-implementations
09:04
03_ordered-operations
06:27
04_binary-search-trees
19:58
05_ordered-operations-in-bsts
10:32
06_deletion-in-bsts
09:54
01_2-3-search-trees
16:56
02_red-black-bsts
35:31
03_b-trees-optional
10:38
01_1d-range-search
08:53
02_line-segment-intersection
05:48
03_kd-trees
29:08
04_interval-search-trees
13:48
05_rectangle-intersection
08:12
01_hash-tables
18:04
02_separate-chaining
07:29
03_linear-probing
14:38
04_hash-table-context
10:11
01_symbol-table-applications-sets-optional
05:05
02_symbol-table-applications-dictionary-clients-optional
05:40
03_symbol-table-applications-indexing-clients-optional
07:54
04_symbol-table-applications-sparse-vectors-optional
07:42
顶部