1 The Role of Algorithms in Computing 2 Getting Started 3 Growth of Functions 4 Divide-and-Conquer 5 Probabilistic Analysis and Randomized Algorithms 6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order Statistics 10 Elementary Data Structures 11 Hash Tables 12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures 15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis 18 B-Trees 19 Fibonacci Heaps 20 van Emde Boas Trees 21 Data Structures for Disjoint Sets 22 Elementary Graph Algorithms 23 Minimum Spanning Trees 24 Single-Source Shortest Paths 25 All-Pairs Shortest Paths 26 Maximum Flow 27 Multithreaded Algorithms 28 Matrix Operations 29 Linear Programming 30 Polynomials and the FFT 31 Number-Theoretic Algorithms 32 String Matching 33 Computational Geometry 34 NP-Completeness 35 Approximation Algorithms
文件格式: PDF大小: 4.84MB页数: 1303
南京大学：《计算机问题求解》课程教学资源（课件讲稿）堆的结构、实现以及算法应用 Heap & HeapSort
文件格式: PDF大小: 5.3MB页数: 81
南京大学：《计算机问题求解》课程教学资源（课件讲稿）排序与选择算法 sorting and selection（简版）
文件格式: PDF大小: 2.13MB页数: 44