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

12.1 Polynomial time algorithms 12.2 Undecidable 12.3 NP-complete 12.4 Approximation algorithms 12.5 Dealing with hard problems

11.1 String matching problem 11.2 Naive string-matching algorithm 11.3 Rabin-Karp algorithm 11.4 Finite automaton 11.5 Knuth-Morris-Pratt algorithm

7.1 Introduction to amortized analysis 7.2 Aggregate method 7.3 Accounting method 7.4 Potential method 7.5 Dynamic tables

1.1 Definition of algorithm 1.2 Insertion sort and merge sort 1.3 Running time and asymptotic analysis 1.4 Θ-notation, Ω-notation, and O-notation 1.5 Recurrences 1.6 Substitution, recursion-tree method, and master method

高职院校教研教改教学资源：《数据结构与算法》课程教学设计（教案）学生成绩管理系统的实现

《试验设计与数据处理》课程教学资源：课程介绍

《门店运营管理》思政课程教学设计（讲义）单元 10 品类管理相关经营数据分析

西安石油大学：《数据结构》精品课程资源_设计大纲

《门店运营管理》思政课程教学设计（讲义）单元 11 分析商品定价与相关经营数据分析