南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论 II 关系

南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论（IV）无穷

南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论（III）函数

南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论 I 公理与操作

《计算机问题求解》课程教学资源（阅读材料）Go To Statement Considered Harmful（Dijkstra CACM 1968）

Chapter 1 Introduction to Computers and C++ Programming Chapter 2 C++ Basics Chapter 3 More Flow of Control Chapter 4 Procedural Abstraction and Functions That Return a Value Chapter 5 Functions for All Subtasks Chapter 6 I/O Streams as an Introduction to Objects and Classes Chapter 7 Arrays Chapter 8 Strings and Vectors Chapter 9 Pointers and Dynamic Arrays Chapter 10 Defining Classes Chapter 11 Friends, Overloaded Operators, and Arrays in Classes Chapter 12 Separate Compilation and Namespaces Chapter 13 Pointers and Linked Lists Chapter 14 Recursion Chapter 15 Inheritance Chapter 16 Exception Handling Chapter 17 Templates Chapter 18 Standard Template Library Appendices 1 C++ Keywords 2 Precedence of Operators 3 The ASCII Character Set 4 Some Library Functions 5 Inline Functions 6 Overloading the Array Index Square Brackets 7 The this Pointer 8 Overloading Operators as Member

1 Preliminaries The Integers 3 Groups 4 Cyclic Groups 5 Permutation Groups 6.1 Cosets 7 Introduction to Cryptography 8 Algebraic Coding Theory 9 Isomorphisms 10 Normal Subgroups and Factor Groups 11 Homomorphisms 12 Matrix Groups and Symmetry 13 The Structure of Groups 14 Group Actions 15 The Sylow Theorems 16 Rings 17 Polynomials 18 Integral Domains 19 Lattices and Boolean Algebras 20 Vector Spaces 21 Fields 22 Finite Fields 23 Galois Theory

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

南京大学：《计算机问题求解》课程教学资源（课件讲稿）Hashing方法

南京大学：《计算机问题求解》课程教学资源（课件讲稿）堆的结构、实现以及算法应用 Heap & HeapSort