ch01--Data Structure and Algorithms 数据结构第一章.pptVIP

Chapter 1Data Structure and Algorithms A Philosophy of Data Structure Abstract Data Type and Data Structure Problems, Algorithms, and Programs 1.1 A Philosophy of Data Structure 1. The Need for Data Structure Data structure + Algorithm = Programming The system development process: (1) the purpose of the project (input,output) (2) break the problem down into management pieces (3) choose concrete representation for data objects and write algorithm for each operations on them (4) developing correctness for programs Data structures organize data? more efficient programes More powerfull Computers? more complex applications More complex applications demand more calculations. Complex computing tasks are unlike our everyday experience. Organizing Data Any organization for a collection of records can be searched. Processed in any order or modified. The choice of data structure and algorithm can make the difference between a program running in a few seconds or many days. Efficiency A solution is said to be efficient if it solves the problem within its resource constraints. -space -time .The cost of a solution is the amount of resources that the solution consumes. 2. Definition: A data structure is any data representation and its associated operation 3.Three Steps to select a data structure Analyze problem, determine the resource constraints Determine the basic operations that must be supported and quantify the resource constraints for each operation Select the data structure that best meets these requirements 4.cost and benefits Each data structure has associated cost and benefits. 1.2 Abstract Data Type and Data Structure Definitions: Type --- a collection of values Data type ------ a type and a set operations that act on this type. Data item --- a piece of information or a record whose value is drawn from a type. Abstract Data Type (ADT) ADT: De