Data Structure.ppt

Data Structure Zhuang Lei ielzhuang@zzu.edu.cn In General, O(f(n)) can be classified as 7 types f(n)=c O(f(n))=O(1) Constant Function f(n)=an+b O(f(n))=O(n) Linear Function f(n)=an2+bn+c (f(n))=O(n2) Square Function f(n)=an3+bn2+cn+d O(f(n))=O(n3) Cube Function O(f(n))=O(2n) Exponent Function O(f(n))=O(log2n) Logarithm Function O(f(n))=O(nlogn) Linearithmic Function * * * * * 1.1 History of Data Structure 1.2 Contents of Data Structure 1.3 Basic Term and Operation 1.4 Algorithm and Efficiency Chapter 1 Introduction Examples: Ex1: Scientific Calculation——Finite Element Method To transform a quadratic functional equation to a group of linear equations with a positive definite symmetric coefficient matrix. 1.1 History of Data Structure 1.2 Applications of Data Structure Examples: Ex1: Scientific Calculation——Finite Element Method To transform a quadratic functional equation to a group of linear equations with a positive definite symmetric coefficient matrix. 1.1 History of Data Structure 1.2 Applications of Data Structure ∵Kij is a positive definite symmetric matrix ∴kij = kji then ∴ only the elements on the diagonal need to store Ex2: Telephone Directory A simple telephone book can be regarded as a group of two-component pairs: (a1, b1), (a2, b2), …, (an, bn) ai is name bi is number 1. Sorting by names with ascending/descending order. 2. Sorting by numbers with ascending/descending order. 3. Sorting by input order. Ex3: Creating A Human Resource Document Management School Business Administration Accounting Technical Economy MIS Finance Teachers Students 2001 2002 2003 2004 Roads C and E are one way, the others two way. There are 13 turns one might make at this intersection. Some pairs of turns, l