投稿

[双语字幕] Princeton University : Algorithms 算法 by Robert Sedgewick

6.8万

123

2017-04-21 20:24:50

详见 https://www.yuque.com/ob26eq/nshoar/mqtuod

算法第四版

Robert Sedgewick

孔乙己2049 发消息

阿里千问，我真的是低估你了…

01_Dynamic_Connectivity_10-22_20170420201350

10:23

02_Quick_Find_10-18_20170420201640

10:19

03_Quick_Union_7-50_20170420202518

07:51

04_Quick-Union_Improvements_13-02_20170420202804

13:04

05_Union-Find_Applications_9-22_20170420203309

09:23

01_Analysis_of_Algorithms_Introduction_8-14

08:15

02_Observations_10-05_20170420204931

10:06

03_Mathematical_Models_12-48_20170420205504

12:49

04_Order-of-Growth_Classifications_14-39_20170420210105

10:59

05_Theory_of_Algorithms_11-35_20170420210403

11:36

06_Memory_8-11_20170420210953

08:11

01_Stacks_16-24_20170420214046

16:25

02_Resizing_Arrays_9-56_20170420214519

09:57

03_Queues_4-33_20170420215143

04:34

04_Generics_9-26_20170420215517

09:27

05_Iterators_7-16_20170420220557

07:17

06_Stack_and_Queue_Applications_13-25__optional

13:25

01_Sorting_Introduction_14-43_20170423001525

14:44

02_Selection_Sort_6-59_20170420224635

06:59

03_Insertion_Sort_9-28_20170423001001

09:29

04_Shellsort_10-48_20170420221300

10:48

05_Shuffling_7-39_20170420224852

06:32

06_Convex_Hull_13-50_20170423001924

13:51

01_Mergesort_23-54_20170426205355

23:54

02_Bottom-up_Mergesort_3-20_20170426204816

03:21

03_Sorting_Complexity_9-05_20170424125039

09:06

04_Comparators_6-43_20170423221619

06:44

05_Stability_5-39_20170420225757

05:40

01_Quicksort_19-33_20170426212256

19:35

02_Selection_7-08_20170427022839

07:09

03_Duplicate_Keys_11-25_20170427120315

11:26

04_System_Sorts_11-50_20170427143129

11:50

01_APIs_and_Elementary_Implementations_12-52_20170427160855

12:53

02_Binary_Heaps_23-36_20170427162257

23:38

03_Heapsort_14-29_20170427165442

14:30

04_Event-Driven_Simulation_22-38_optional_20170506183554

22:40

05 Symbol_Table_API_21-30_20170507180232

21:31

06 Elementary_Implementations_9-03_20170507212241

09:04

07 Ordered_Operations_6-26_20170507213459

06:27

09 Binary_Search_Trees_19-56_20170507214707

19:58

09 Ordered_Operations_in_BSTs_10-31_20170507215154

10:32

10 Deletion_in_BSTs_9-52_20170507213246

09:54

01_2-3_Search_Trees_16-55_20170507192122

08:18

02_Red-Black_BSTs_35-30_20170507201227

35:33

03_B-Trees_10-36_optional_20170507202536

10:38

04_1d_Range_Search_8-51_20170507205309

08:52

05_Line_Segment_Intersection_5-46_20170507205738

05:47

06_Kd-Trees_29-07_20170507205951

29:10

07_Interval_Search_Trees_13-47_20170507211221

13:48

08_Rectangle_Intersection_8-10_20170507212007

08:11

01_Hash_Functions_18-13_20170506004630

18:04

02_Separate_Chaining_7-28_20170506141117

07:28

03_Linear_Probing_14-37_20170506170707

14:38

04_Hash_Table_Context_10-09_20170506171017

10:10

05_Symbol_Table_Applications-_Sets_5-04_optional_20170506172627

05:05

06_Symbol_Table_Applications-_Dictionary_Clients_5-40_optional_20170506173048

05:39

07_Symbol_Table_Applications-_Indexing_Clients_8-57_optional_20170506173338

07:53

08_Symbol_Table_Applications-_Sparse_Vectors_7-41_optional_20170506182952

07:41

01_Introduction_to_Graphs_9-32

09:33

02_Graph_API_14-47

14:48

03_Depth-First_Search_26-22

26:24

04_Breadth-First_Search_13-34

13:35

05_Connected_Components_18-56

18:57

06_Graph_Challenges_14-29

14:30

01_Introduction_to_Digraphs_8-30

08:30

02_Digraph_API_4-56

04:56

03_Digraph_Search_20-56

20:58

04_Topological_Sort_12-54

12:55

05_Strong_Components_20-22

20:23

01_Introduction_to_MSTs_4-04

04:04

02_Greedy_Algorithm_12-56

12:57

03_Edge-Weighted_Graph_API_11-15

11:16

04_Kruskals_Algorithm_12-28

12:29

05_Prims_Algorithm_33-15

33:19

06_MST_Context_10-34

10:35

01_Shortest_Paths_APIs_10-51

10:52

02_Shortest_Path_Properties_14-46

14:47

03_Dijkstras_Algorithm_18-58

18:59

04_Edge-Weighted_DAGs_19-23

19:25

05_Negative_Weights_21-01

21:03

01_Introduction_to_Maxflow_10-33

10:34

02_Ford-Fulkerson_Algorithm_6-32

06:33

03_Maxflow-Mincut_Theorem_9-38

09:39

04_Running_Time_Analysis_8-49

08:50

05_Java_Implementation_14-29

14:30

06_Maxflow_Applications_22-20

22:21

01_Strings_in_Java_17-43

17:44

02_Key-Indexed_Counting_12-06

12:07

03_LSD_Radix_Sort_15-00

15:01

04_MSD_Radix_Sort_13-41

13:43

05_3-way_Radix_Quicksort_7-22

07:23

06_Suffix_Arrays_19-25

19:26

01_R-way_Tries_32-19

32:22

02_Ternary_Search_Tries_22-42

22:44

03_Character-Based_Operations_20-03

20:05

01_Introduction_to_Substring_Search_6-42

06:42

02_Brute-Force_Substring_Search_10-11

10:11

03_Knuth-Morris-Pratt_33-14

33:17

04_Boyer-Moore_8-36

08:37

05_Rabin-Karp_16-13

16:14

01_Regular_Expressions_20-03

20:04

02_REs_and_NFAs_13-14

13:15

03_NFA_Simulation_18-27

18:26

04_NFA_Construction_11-42

11:43

05_Regular_Expression_Applications_20-09

20:08

01_Introduction_to_Data_Compression_22-27

22:28

02_Run-Length_Coding_5-59

05:59

03_Huffman_Compression_24-14

24:16

04_LZW_Compression_27-33

27:35

01_Introduction_to_Reductions_9-25

09:32

02_Designing_Algorithms_8-13

08:13

03_Establishing_Lower_Bounds_9-16

09:23

04_Classifying_Problems_12-45

12:46

01_Brewers_Problem_21-15

21:17

02_Simplex_Algorithm_11-49

11:50

03_Simplex_Implementations_16-21

16:22

04_Linear_Programming_Reductions_11-46

11:46

01_Introduction_to_Intractability_17-00

17:01

02_Search_Problems_10-56

10:57

03_P_vs._NP_16-29

16:30

04_Classifying_Problems_13-43

13:44

05_NP-Completeness_12-38

12:39

06_Coping_with_Intractability_14-01

14:02

顶部