/img/node.jpg

Algorithms Analysis

Data Structure Algorithms Analysis Algorithm Define: A finite, clearly specified sequence of instructions to be followed to solve a problem.(not a program) Five features Finiteness Definiteness Effectiveness Input Output Design Requirements Correctness Readability Robustness High efficiency and low memory capacity Algorithm Analysis Computing time and memory space are two important resources. Running time Analysis The estimation of the running time of algorithms. The running times of algorithms can be changed because of the platform, the properties of the computer, etc.

Introduction

Data Structure Introduction Data Define: The set of all the symbols can be processed or stored by a computer Example: A data set in a classroom = { desk 1, desk 2,…chair 1, chair2…,stud 1, stud 2,…} Data Element Define: The term data element is an atomic unit of data that has: An identification such as a data element name A clear data element definition Example: desk i; chair j; project n…

Tree

Data Structure Tree Definition One natural way to define a tree is recursively. A tree is a collection of nodes. The collection can be empty; otherwise, a tree consists of a distinguished node r,called root, and zero or more nonempty (sub)trees $T_1, T_2, … T_k$, each of whose roots are connected by a direct edge from r. Terminology Parent: Node A is the parent of node B, if B is the root of one subtree of A.