[工学]计算机概论 第九节.ppt

Chapter 9 Abstract Data Types and Algorithms Chapter Goals Define an abstract data type and discuss its role in algorithm development Distinguish between a data type and a data structure Distinguish between an array-based implementation and a linked implementation Distinguish between an array and a list Chapter Goals Distinguish between an unsorted list and a sorted list Distinguish between a selection sort and a bubble sort Describe the Quicksort algorithm Apply the selection sort, the bubble sort, and the Quicksort to a list of items by hand Apply the binary search algorithm Chapter Goals Distinguish between the behavior of a stack and a queue Draw the binary search tree that is built from inserting a series of items Demonstrate your understanding of the algorithms in this chapter by hand simulating them with a sequence of items Abstract Data Types Abstract data type A data type whose properties (data and operations) are specified independently of any particular implementation Remember what the most powerful tool there is for managing complexity? Three Views of Data Application (user) level View of the data within a particular problem View sees data objects in terms of properties and behaviors Three Views of Data Logical (abstract) level Abstract view of the data and the set of operations to manipulate them View sees data objects as groups of objects with similar properties and behaviors Three Views of Data Implementation level A specific representation of the structure that hold the data items and the coding of the operations in a programming language View sees the properties represented as specific data fields and behaviors represented as methods implemented in code Three Views of Data Describe a word processor from the three views Three Views of Data Composite data type A data type in which a name is given to a collection of data value Data structures The implementation of a composite data fields in an abstract data type Containers Objects whole role