数据结构(data structure).pptxVIP

Chapter 01 Introduction第一章 绪论Prof. Qing WangOverview在综述数据、数据结构和抽象数据类型等基本概念的基础上，从抽象数据类型的角度，分别讨论线性表、栈、队列、串、数组、广义表、树和二叉树以及图等基本类型的数据结构及其应用；讨论查找和排序，除了介绍各种实现方法之外，并着重从时间上进行定性或定量的分析和比较。突出抽象数据类型的概念。对每一种数据结构，都分别给出相应的抽象数据类型规范说明和实现方法。使学生奠定良好的面向对象思想进行软件开发的理论和实现基础。 Prof. Q. WangA good exampleint a=1, b=2, c;c=a+b;float f1=1.0, f2=2.0, f3;f3=f1+f2;If c1 and c2 are two complex numbers, how to deal with c1+c2?Prof. Q. Wang class Complex { double real, imag; public: Complex(double r=0.0,double i=0.0) { real=r; imag=i; } Complex(const Complex ob) { real=ob.real; imag=ob.imag; } Complex operator +(Complex c) { Complex temp; temp.real=real+c.real; temp.imag=imag+c.imag; return temp; } Complex operator -(Complex c) { Complex temp; temp.real=real-c.real; temp.imag=imag-c.imag; return temp; }Solution Complex operator *(Complex c) { Complex temp; temp.real=real*c.real-imag*c.imag; temp.imag=real*c.imag+imag*c.real; return temp; } Complex operator =(Complex c) { real=c.real; imag=c.imag; return *this; } int operator ==(Complex c) { return((real==c.real)(imag==c.imag)) } int operator !=(Complex c) { return((real!=c.real)||(imag!=c.imag)) }}; A building planProf. Q. WangBasic UnitsProf. Q. WangUML diagram of a complex problem/wiki/Unified_Modeling_LanguageProf. Q. WangPersonCourseSessionEmployeeApplicantCourseRegistrationRegistrationFormTestPermittedStatusChangeApplicationExamExamSessionApp StatusProf. Q. WangData StructureLinear ListTreeGraphGeneric ListGeneric treeDirected graphStackBinary treeUndirectedQueueWeighted treeNetStringMatrixGeneral listConcepts ADTAlgorithms ImplementationApplicationsSortingSearchingOther applicationsProf. Q. WangContentsWhat’s Data Structure?Problem solvingBasic concepts of Data StructureAbstract Data Type (ADT) (Philosophy)AlgorithmAlgorithm Analysis (Philosophy)Reviews of C languageConclusionProf. Q. WangHistory of ProgrammingNon structure period1940s-1960sStructure oriented programming1960s-1980sObject oriented programming1980s~Popular in 1990sNew tr