1 (p1): Chapter 1 Programming：A General Overview1 (p1-1): 1.1 What’s This Book About？2 (p1-2): 1.2 Mathematics Review3 (p1-2-1): 1.2.1 Exponents3 (p1-2-2): 1.2.2 Logarithms4 (p1-2-3): 1.2.3 Series5 (p1-2-4): 1.2.4 Modular Arithmetic6 (p1-2-5): 1.2.5 The P Word8 (p1-3): 1.3 A Brief Introduction to Recursion12 (p1-4): 1.4 C＋＋ Classes12 (p1-4-1): 1.4.1 Basic class Syntax13 (p1-4-2): 1.4.2 Extra Constructor Syntax and Accessors16 (p1-4-3): 1.4.3 Separation of Interface and Implementation19 (p1-4-4): 1.4.4 vector and stri ng21 (p1-5): 1.5 C＋＋ Details21 (p1-5-1): 1.5.1 Pointers23 (p1-5-2): 1.5.2 Lvalues，Rvalues，and References25 (p1-5-3): 1.5.3 Parameter Passing27 (p1-5-4): 1.5.4 Return Passing29 (p1-5-5): 1.5.5 std：：swap and std：：move30 (p1-5-6): 1.5.6 The Big-Five：Destructor，Copy Constructor，Move Constructor，Copy Assignment operator=，Move Assignment operator=35 (p1-5-7): 1.5.7 C-style Arrays and Strings36 (p1-6): 1.6 Templates37 (p1-6-1): 1.6.1 Function Templates38 (p1-6-2): 1.6.2 Class Templates39 (p1-6-3): 1.6.3 Object，Comparable，and an Example41 (p1-6-4): 1.6.4 Function Objects44 (p1-6-5): 1.6.5 Separate Compilation of Class Templates44 (p1-7): 1.7 Using Matrices44 (p1-7-1): 1.7.1 The Data Members，Constructor，and Basic Accessors45 (p1-7-2): 1.7.2 operator[]46 (p1-7-3): 1.7.3 Big-Five46 (p1-7-4): Summary46 (p1-7-5): Exercises48 (p1-7-6): References51 (p2): Chapter 2 Algorithm Analysis51 (p2-1): 2.1 Mathematical Background54 (p2-2): 2.2 Model54 (p2-3): 2.3 What to Analyze57 (p2-4): 2.4 Running-Time Calculations58 (p2-4-1): 2.4.1A Simple Example58 (p2-4-2): 2.4.2General Rules60 (p2-4-3): 2.4.3Solutions for the Maximum Subsequence Sum Problem66 (p2-4-4): 2.4.4Logarithms in the Running Time70 (p2-4-5): 2.4.5Limitations of Worst-Case Analysis70 (p2-4-6): Summary71 (p2-4-7): Exercises76 (p2-4-8): References77 (p3): Chapter 3 Lists，Stacks，and Queues77 (p3-1): 3.1Abstract Data Types （ADTs）78 (p3-2): 3.2The List ADT78…