算法与数据结构 C++版:课程资料
课程内容简介:
第9章 最短路径
第8章 最小生成树
第7章 图的基础
第6章 并查集
第5章 二分搜索树
第4章 堆和堆排序
第3章 高级排序算法
第2章 排序基础
第1章 我们谈论算法
+00-Opening 2.0 MB
Chapter-0-watermarked.pdf 2.0 MB
+01-Why-Algorithms 9.4 MB
Chapter-1-watermarked.pdf 9.4 MB
+02-Sorting-Basic 830.0 KB
|+Course Code (C++) 43.0 KB
|+01-Selection-Sort 734 Byte
|CMakeLists.txt 186 Byte
|main.cpp 548 Byte
|+02-Selection-Sort-Using-Template 2.8 KB
|CMakeLists.txt 234 Byte
|main.cpp 1.2 KB
|Student.h 1.5 KB
|+03-Selection-Sort-Generate-Test-Cases 1.8 KB
|CMakeLists.txt 251 Byte
|main.cpp 590 Byte
|SortTestHelper.h 950 Byte
|+04-Selection-Sort-Detect-Performance 3.3 KB
|CMakeLists.txt 249 Byte
|main.cpp 553 Byte
|SortTestHelper.h 2.5 KB
|+05-Insertion-Sort 3.7 KB
|CMakeLists.txt 227 Byte
|main.cpp 1.1 KB
|SelectionSort.h 535 Byte
|SortTestHelper.h 1.9 KB
|+06-Insertion-Sort-Advance 5.4 KB
|CMakeLists.txt 243 Byte
|main.cpp 2.1 KB
|SelectionSort.h 559 Byte
|SortTestHelper.h 2.5 KB
|+Chapter-02-Completed-Code 5.2 KB
|CMakeLists.txt 204 Byte
|InsertionSort.h 490 Byte
|main.cpp 1.5 KB
|SelectionSort.h 526 Byte
|SortTestHelper.h 2.5 KB
|+Optional-01-Optimized-Selection-Sort 6.3 KB
|CMakeLists.txt 232 Byte
|InsertionSort.h 230 Byte
|main.cpp 2.7 KB
|SelectionSort.h 595 Byte
|SortTestHelper.h 2.5 KB
|+Optional-02-Bubble-Sort 7.2 KB
|CMakeLists.txt 255 Byte
|InsertionSort.h 511 Byte
|main.cpp 3.6 KB
|SelectionSort.h 541 Byte
|SortTestHelper.h 2.3 KB
|+Optional-03-Shell-Sort 6.6 KB
| BubbleSort.h 679 Byte
| CMakeLists.txt 266 Byte
| InsertionSort.h 508 Byte
| main.cpp 2.3 KB
| SelectionSort.h 538 Byte
| SortTestHelper.h 2.4 KB
|+Course Code (Java) 53.5 KB
|+01-Selection-Sort 942 Byte
| |+src 942 Byte
|+02-Selection-Sort-Using-Comparable 2.7 KB
| |+src 2.7 KB
|+03-Selection-Sort-Generate-Test-Cases 1.8 KB
| |+src 1.8 KB
|+04-Selection-Sort-Detect-Performance 3.6 KB
| |+src 3.6 KB
|+05-Insertion-Sort 4.9 KB
|+06-Insertion-Sort-Advance 6.8 KB
|+Chapter-02-Completed-Code 6.3 KB
|+Optional-01-Optimized-Selection-Sort 8.7 KB
|+Optional-02-Bubble-Sort 9.4 KB
|+Optional-03-Shell-Sort 8.4 KB
Chapter-2-watermarked.pdf 733.0 KB
+03-Sorting-Advance 2.3 MB
|+Course Code (C++) 122.0 KB
|+02-Merge-Sort 6.4 KB
|CMakeLists.txt 219 Byte
|InsertionSort.h 493 Byte
|main.cpp 3.3 KB
|SortTestHelper.h 2.4 KB
|+03-Merge-Sort-Advance 7.3 KB
|CMakeLists.txt 247 Byte
|InsertionSort.h 832 Byte
|main.cpp 2.0 KB
|MergeSort.h 1.8 KB
|SortTestHelper.h 2.4 KB
|+04-Merge-Sort-Bottom-Up 8.2 KB
|CMakeLists.txt 251 Byte
|InsertionSort.h 838 Byte
|main.cpp 2.6 KB
|MergeSort.h 2.1 KB
|SortTestHelper.h 2.4 KB
|+05-Quick-Sort 7.7 KB
|CMakeLists.txt 231 Byte
|InsertionSort.h 808 Byte
|main.cpp 2.2 KB
|MergeSort.h 2.1 KB
|SortTestHelper.h 2.4 KB
|+06-Quick-Sort-Deal-With-Nearly-Ordered-Array 8.8 KB
|CMakeLists.txt 293 Byte
|InsertionSort.h 901 Byte
|main.cpp 3.0 KB
|MergeSort.h 2.2 KB
|SortTestHelper.h 2.5 KB
|+07-Quick-Sort-Deal-With-Identical-Keys 9.5 KB
|CMakeLists.txt 281 Byte
|InsertionSort.h 883 Byte
|main.cpp 3.7 KB
|MergeSort.h 2.2 KB
|SortTestHelper.h 2.5 KB
|+08-Quick-Sort-Three-Ways 11.2 KB
|CMakeLists.txt 265 Byte
|InsertionSort.h 841 Byte
|main.cpp 3.3 KB
|MergeSort.h 2.1 KB
|QuickSort.h 2.3 KB
|SortTestHelper.h 2.4 KB
|+Chapter-03-Completed-Code 20.3 KB
|CMakeLists.txt 210 Byte
|InsertionSort.h 832 Byte
|main.cpp 3.9 KB
|MergeSort.h 1.8 KB
|MergeSortBU.h 1.9 KB
|MergeSortBUO.h 2.1 KB
|MergeSortO.h 2.4 KB
|QuickSort.h 1.2 KB
|QuickSort2Ways.h 1.8 KB
|QuickSort3Ways.h 1.3 KB
|SortTestHelper.h 2.9 KB
|+Optional-01-MergeSort-Create-aux-Array-Out-of-Merge 8.6 KB
|CMakeLists.txt 180 Byte
|InsertionSort.h 790 Byte
|main.cpp 1.3 KB
|MergeSort.h 1.7 KB
|MergeSort2.h 2.2 KB
|SortTestHelper.h 2.4 KB
|+Optional-02-MergeSort-and-MergeSortBU-Perfermance-Comparison 11.1 KB
|CMakeLists.txt 273 Byte
|InsertionSort.h 862 Byte
|main.cpp 2.0 KB
|MergeSort.h 5.1 KB
|SortTestHelper.h 2.9 KB
|+Optional-03-ShellSort-MergeSort-and-QuickSort-Comparision 13.7 KB
|+Optional-04-Inversion-Number 5.9 KB
|+Optional-05-Selection 3.8 KB
|+Course Code (Java) 151.0 KB
Chapter-3-watermarked.pdf 2.0 MB
+04-Heap 1.4 MB
|+Course Code (C++) 92.8 KB
|+02-Max-Heap-Class-Basic 954 Byte
|+03-Shift-Up 4.6 KB
|+04-Shift-Down 2.6 KB
|+05-Heapify 16.8 KB
|+06-Heap-Sort 18.7 KB
|+08-Index-Heap 8.1 KB
|+09-Index-Heap-Advance 9.9 KB
|+Chapter-04-Completed-Code 8.2 KB
|+Optional-1-Optimized-Shift-Up-and-Shift-Down 9.1 KB
|+Optional-2-Min-Heap 6.0 KB
|+Optional-3-Index-Min-Heap 7.9 KB
|+Course Code (Java) 121.0 KB
|+02-Max-Heap-Class-Basic 683 Byte
|+03-Shift-Up 5.7 KB
|+04-Shift-Down 2.9 KB
|+05-Heapify 21.9 KB
|+06-Heap-Sort 24.2 KB
|+08-Index-Heap 9.8 KB
|+09-Index-Heap-Advance 11.2 KB
|+Chapter-04-Completed-Code 13.6 KB
|+Optional-1-Optimized-Shift-Up-and-Shift-Down 13.6 KB
|+Optional-2-Min-Heap 8.4 KB
|+Optional-3-Index-Min-Heap 9.5 KB
Chapter-4-watermarked.pdf 1.2 MB
+05-Binary-Search-Tree 7.4 MB
|+Course Code (C++) 2.4 MB
|+01-Binary-Search 2.9 KB
|+02-Binary-Search-Tree-Basics 1.1 KB
|+03-Binary-Search-Tree-Insert 1.9 KB
|+04-Binary-Search-Tree-Search 2.2 MB
|+05-Binary-Search-Tree-Traverse 5.3 KB
|+06-Binary-Search-Tree-Level-Traverse 5.8 KB
|+07-Binary-Search-Tree-Remove-Min-and-Max 8.0 KB
|+08-Binary-Search-Tree-Remove 9.5 KB
|+10-The-Disadvantages-of-Binary-Search-Tree-and-More-Trees 88.4 KB
|+Chapter-05-Completed-Code 88.3 KB
|+Optional-02-Floor-and-Ceil-in-Binary-Search 3.0 KB
|+Optional-03-Lower-Bound-and-Upper-Bound-in-Binary-Search 3.8 KB
|+Optional-04-More-about-Binary-Search 5.9 KB
|+Optional-05-Floor-and-Ceil-in-BST 12.5 KB
|+Optional-06-Predecessor-and-Successor-in-BST 15.4 KB
|+Optional-09-Binary-Tree-Classic-Nonrecursive-Traversal 15.5 KB
|+Optional-10-Binary-Tree-Morris-Traversal 4.7 KB
|+Course Code (Java) 2.5 MB
|+01-Binary-Search 4.9 KB
|+02-Binary-Search-Tree-Basics 1.0 KB
|+03-Binary-Search-Tree-Insert 1.8 KB
|+04-Binary-Search-Tree-Search 2.2 MB
|+05-Binary-Search-Tree-Traverse 6.9 KB
|+06-Binary-Search-Tree-Level-Traverse 7.6 KB
|+07-Binary-Search-Tree-Remove-Min-and-Max 9.7 KB
|+08-Binary-Search-Tree-Remove 11.4 KB
|+10-The-Disadvantages-of-Binary-Search-Tree-and-More-Trees 89.6 KB
|+Chapter-05-Completed-Code 89.6 KB
|+Optional-02-Floor-and-Ceil-in-Binary-Search 3.9 KB
|+Optional-03-Lower-Bound-and-Upper-Bound-in-Binary-Search 3.6 KB
|+Optional-04-More-about-Binary-Search 6.3 KB
|+Optional-05-Floor-and-Ceil-in-BST 15.0 KB
|+Optional-06-Predecessor-and-Successor-in-BST 17.8 KB
|+Optional-09-Binary-Tree-Classic-Nonrecursive-Traversal 12.0 KB
|+Optional-10-Binary-Tree-Morris-Traversal 4.1 KB
Chapter-5-watermarked.pdf 2.5 MB
+06-Union-Find 1.1 MB
|+Course Code (C++) 91.5 KB
|+02-Quick-Find 3.3 KB
|+03-Quick-Union 6.3 KB
|+04-Optimize-by-Size 9.4 KB
|+05-Optimize-by-Rank 12.6 KB
|+06-Path-Compression 16.1 KB
|+Chapter-06-Completed-Code 16.1 KB
|+Optional-01-Same-Cases-Test-for-UF 20.2 KB
|+Optional-02-Path-Compression-Comparison 7.4 KB
|+Course Code (Java) 84.2 KB
|+02-Quick-Find 2.5 KB
|+03-Quick-Union 5.4 KB
|+04-Optimize-by-Size 8.4 KB
|+05-Optimize-by-Rank 11.5 KB
|+06-Path-Compression 15.0 KB
|+Chapter-06-Completed-Code 15.0 KB
|+Optional-01-Same-Cases-Test-for-UF 19.6 KB
|+Optional-02-Path-Compression-Comparison 6.7 KB
Chapter-6-watermarked.pdf 956.0 KB
+07-Graph-Basics 5.2 MB
|+Course Code (C++) 192.0 KB
|+02-Graph-Representation 3.1 KB
|+03-Vertex Adjacent Iterator 6.5 KB
|+04-Read-Graph 8.0 KB
|+05-DFS-and-Components 10.0 KB
|+06-Finding-a-Path 134.0 KB
|+07-BFS-and-Shortest-Path 13.7 KB
|+Chapter-07-Completed-Code 16.1 KB
|+Course Code (Java) 57.1 KB
|+02-Graph-Representation 2.5 KB
|+03-Vertex-Adjacent-Iterator 3.1 KB
|+04-Read-Graph 7.2 KB
|+05-DFS-and-Components 8.2 KB
|+06-Finding-a-Path 8.5 KB
|+07-BFS-and-Shortest-Path 12.1 KB
|+Chapter-07-Completed-Code 15.6 KB
Chapter-7-watermarked.pdf 5.0 MB
+08-Minimum-Span-Trees 8.4 MB
|+Course Code (C++) 3.7 MB
|+01-Weighted-Graph 10.3 KB
|+03-Lazy-Prim 14.9 KB
|+05-Implementation-of-Optimized-Prim-Algorithm 1.2 MB
|+06-Kruskal-Algorithm 1.2 MB
|+Chapter-08-Completed-Code 1.2 MB
|+Course Code (Java) 3.7 MB
|+01-Weighted-Graph 9.1 KB
|+03-Lazy-Prim 14.6 KB
|+05-Implementation-of-Optimized-Prim-Algorithm 1.2 MB
|+06-Kruskal-Algorithm 1.2 MB
|+Chapter-08-Completed-Code 1.2 MB
Chapter-8-watermarked.pdf 1.0 MB
+09-Shortest-Path 875.0 KB
|+Course Code (C++) 59.2 KB
|+03-Implementation-of-Dijkstra 18.8 KB
|+05-Implementation-of-Bellman-Ford 15.7 KB
|+Chapter-09-Completed-Code 24.7 KB
|+Course Code (Java) 55.5 KB
|+03-Implementation-of-Dijkstra 17.8 KB
|+05-Implementation-of-Bellman-Ford 14.1 KB
|+Chapter-09-Completed-Code 23.7 KB
Chapter-9-watermarked.pdf 761.0 KB
+10-Ending 592.0 KB
Chapter-10-watermarked.pdf 592.0 KB
.gitignore 475 Byte
qrcode.jpg 40.7 KB
README.md 39.3 KB