9.1 排序的基本概念 9.2 插入排序 9.3 交换排序 9.4 选择排序 9.5 各种排序方法的比较

《数据挖掘导论 Introduction to Data Mining》课程教学资源（PPT课件讲稿）Data Mining Classification（Basic Concepts, Decision Trees, and Model Evaluation）

2.1 Preface Performance of a program: the amount of computer memory and time needed to run a program We use two approaches to determine it: performance analysis performance measurement

4.1 1D-Array 1. One-dimensional array 1D-array is a limited sequence composed of n (n20) elements which are of the same data type. For example:

• 集合及其表示 • 并查集与等价类 • 字典 • 散列

• 一维数组与多维数组 • 特殊矩阵 • 稀疏矩阵 • 字符串 • 广义表

Main topics Definition of graphs and some terminology Three common graph representations Some algorithms

9.1 Introduction A priority queue is a collection of zero or more elements. Each element has a priority or value

Two kinds of data structure Linear: list, stack, queue, string Non-linear: tree, graph

The purpose and contents of the course Introduce most used data structures and algorithms Prerequisite of other courses Introduce algorithm analysis Review C++