Data Structures （资料结构）【荐】.docVIP

Data Structures (資料結構) 講師 姓名: 王正豪 E-Mail: f3506002@.tw Homepage: .tw/~chwang 課程大綱 Introduction Arrays (陣列) Stacks (堆疊) and Queues (佇列) Structures (結構) and Pointers (指標) *Linked Lists (串列) *Trees (樹) and Graphs (圖) Sorting (排序): Insertion Sort, … Searching (搜尋): Sequential Search, Binary Search, … 參考書籍 Fundamentals of Data Structures in C++, Ellis Horowitz, Sartaj Sahni, and Dinesh Mehta, Computer Science Press, 1995. The C++ Programming Language, 2nd ed., Bjarne Stroustrup, Addison-Wesley Pub. Co., 1991.  1. Introduction Why Data Structures? Programming ( Problem-Solving Algorithms (演算法) + Data Structures = Programs (by Niklaus Wirth) Algorithm: a finite set of instructions that accomplishes a particular task Input (輸入) Output (輸出) Definiteness (明確): clear and unambiguous Finiteness Effectiveness (有效率) How to Create Programs? Requirements: input, output Design: data objects, operations Analysis: top-down vs. bottom-up Refinement and Coding Verification: proving, testing, and debugging Example: 學生成績統計與排名 Criteria for Judging Programs Correct (正確性) Readable () Performance (效率) Time Complexity: computing time Space Complexity: storage requirement … Data Objects Constant (常數): a fixed value Variable (變數): a place to hold a value Type (類型): int, char, … Name (名稱): version, name, … Value (數值): 98, “Windows”, … Declarations (宣告): 在第一次使用變數前, 必須先宣告它的Type和Name, 有時也會先給定初始值(initialize). Examples: int score; // 宣告score這個變數為int (整數, integer) char passed =’N’; // 宣告passed為char, 並給予初值’N’ Definitions (定義): 在宣告過後, 變數就可以拿來存放一些data. Examples: score = 85; // 將85存入score中 passed = ‘Y’; // 將字元’Y’存入passed中 2. Array (陣列) Array: a set of pairs (index, value) Example: int v[10]; // 宣告v為包含10個整數的陣列: v[0], v[1], …, v[9] char s[20]; // 宣告s為包含20個字元的陣列 // … Ordered list: (a0, a1, a2, … an-1) Examples: (Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday) (2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace) 1-dimensional array (一維陣列) 2-dimensional array (二維陣列): matrix (矩陣) n-dimensional