2.1 Divide-and-conquer design paradigm 2.2 Recurrence for merge sort and binary search 2.3 Powering a number 2.4 Fibonacci numbers 2.5 Recursive squaring 2.6 Matrix multiplication 2.7 Strassen's algorithm

3.1 Definition of data structure 3.2 Stacks 3.3 Queues 3.4 Linked lists 3.5 Trees 3.6 Postfix expression 3.7 Infix to postfix conversion

5.1 Dictionary problem 5.2 Hash functions 5.3 Collisions resolution by chaining 5.4 Open addressing 5.5 Probing strategies: linear, quadratic, and double hashing 5.6 Analysis of open addressing

《工程科学学报》：超重力冶金：科学原理、实验方法、技术基础、应用设计

《工程科学学报》：基于金属有机框架材料设计合成锂离子电池电极材料的研究进展

8.1 Manufacturing problem 8.2 Matrix-chain multiplication 8.3 Elements of dynamic programming 8.4 Four steps of development 8.5 Longest common subsequence problem

9.1 Activity-selection problem 9.2 Introduction to greedy solution 9.3 Steps of the greedy strategy 9.4 Knapsack problem 9.5 Huffman code

西安石油大学：《机械设计基础》课程教学资源（各章练习）第09章 机械零件设计概论 9.3 考点及常见题型精解

西安石油大学：《机械设计基础》课程教学资源（各章练习）第09章 机械零件设计概论 9.1 重点内容提要

《工程科学学报》：低冰粘附强度表面设计与制备研究进展（国防科技大学）