DATA STRUCTURES AND ALGORITHMS - Engin Dutar数据结构与算法-工程都塔尔.pptVIP

Feb 2006 Data Structures Algorithms - Lecture 1 DATA STRUCTURES AND ALGORITHMS Lecture Notes 1 Prepared by ?nan? TAHRALI ROAD MAP What is an algorithm ? What is a data structure ? Analysis of An Algorithm Asymptotic Notations Big Oh Notation Omega Notation Theta Notation Little o Notation Rules about Asymptotic Notations What is An Algorithm ? Definition : A finite, clearly specified sequence of instructions to be followed to solve a problem. What is An Algorithm ? int Sum (int N) PartialSum ? 0 i ? 1 foreach (i 0) and (i=N) PartialSum ? PartialSum + (i*i*i) increase i with 1 return value of PartialSum Properties of an Algorithm Effectiveness simple can be carried out by pen and paper Definiteness clear meaning is unique Correctness give the right answer for all possible cases Finiteness stop in reasonable time Is function F an algorithm? int F (int m) { n = m; while (n1) { if (n/2 == 0) n=n/2; else n=3*n+1; } return m; } What is a Data Structure ? Definition : An organization and representation of data representation data can be stored variously according to their type signed, unsigned, etc. example : integer representation in memory organization the way of storing data changes according to the organization ordered, inordered, tree example : if you have more then one integer ? Properties of a Data Structure ? Efficient utilization of medium Efficient algorithms for creation manipulation (insertion/deletion) data retrieval (Find) A well-designed data structure allows using little resources execution time memory space The Process of Algorithm Development Design divideconquer, greedy, dynamic programming Validation check whether it is correct Analysis determine the properties of algorithm Implementation Testing check whether it works for all possible cases Analysis of Algorithm Analysis investigates What are the properties of the algorithm? in terms of time and space How good is the algorithm ? according t