【正文】 Or Table1DatabaseName = ExtractFilePath (ApplicationExeName+ DB)。s issue of a state tree, teaching programming issues such as a peak, known as a data element. Sometimes, a data from a number of data elements (Data Item), for example, the student information management system students each data element table is a student record. It includes students of the school, name, sex, nationality, date of birth, performance data items. These data items can be divided into two types : one called early such as student gender, origin, etc., these data were no longer divided in data processing, the smallest units。最后向在百忙之中評(píng)審本文的各位專家、老師表示衷心的感謝！參考文獻(xiàn)[1] 嚴(yán)蔚敏,吳偉民.《數(shù)據(jù)結(jié)構(gòu)（C語(yǔ)言版）》[M].北京：清華大學(xué)出版社,2009.[2] 朱戰(zhàn)立.《數(shù)據(jù)結(jié)構(gòu)（C語(yǔ)言版）》[M].陜西：西安交通大學(xué)出版社,.[3] [J].信息工程學(xué)院學(xué)報(bào),.[4] [J].計(jì)算機(jī)教育,.[5] [J].電子制作,.[6] [J].電腦知識(shí)與技術(shù),[7] 林銳,韓永泉著.《高質(zhì)量程序設(shè)計(jì)指南——C++/C語(yǔ)言》[M].北京：電子工業(yè)出版社,2007.[8] Bruce Eckel.《Java編程思想》[M].北京：機(jī)械工業(yè)出版社,.[9] Lan Sommerville.《軟件工程》[M].北京：機(jī)械工業(yè)出版社,.[10] 王克宏,董麗,朱家維.《Java技術(shù)及其應(yīng)用》[M].北京：高等教育出版社,.[11] Mark Allen Weiss.《數(shù)據(jù)結(jié)構(gòu)與算法分析》[M].北京：機(jī)械工業(yè)出版社,2008.[12] 蘇小紅,陳惠鵬,孫志崗.《C語(yǔ)言大學(xué)實(shí)用教程》[M].北京：電子工業(yè)出版社,2007.[13]劉振安.《C語(yǔ)言程序設(shè)計(jì)》[M].北京：機(jī)械工業(yè)出版社,2007.[14]R A Finkel,J L Trees A Data Structure for Retrieval on Composite Keys[J].Acta Informatica,.[15]J L Bentley,J H Structures for Range Searching[J].Computing Surveys,.科技外文文獻(xiàn)Data StructuresComputer programming data structure is an important theoretical basis for the design, it is not only the core curriculum of puter disciplines, and has bee a popular elective course other Polytechnic professional, so studied this course well and studied puter are closely related.1 the concept of data structureComputer data structure is the foundation of science and technology professional classes, is the essential core curriculum. All puter system software and application software to use various types of data structures. Therefore, if we want to make better use of puters to solve practical problems, only to several puter programming languages are difficult to cope with the many plex issues. To the effective use of puters, give full play to puter performance, but also must learn and master relevant knowledge of data structure. A solid foundation of data structure for learning other puter professional courses, such as operating systems, translation theory, database management systems, software engineering, artificial intelligence, etc. are very useful.2 why should learn from data structure？In the early development of puters, the use of puter designed primarily to deal with terms. When we use the puter to solve a specific problem, the following general needs through several steps : the first is a specific problem of appropriate abstract mathematical models, and then design or choose a mathematical model of the algorithm,the final procedures for debugging, testing, until they have the ultimate answer. Since then the object is INTEGER, REAL, BOOLEAN, the procedures of the main designers of energy is focused on programming skills, without attention to the data structure. With the expansion of puter applications and development of software and hardware, the issue of nonterms increasing importance. According to statistics, Now dealing with the issue of nonoccupancy of more than 90% of the machine time. Such issues involve more plex data structure, the relationships between data elements generally can not be described by mathematical formula. Therefore, the key to solving such problems is no longer mathematical analysis and calculations, but to devise appropriate data structure, can effectively address the problem. Description of the terms of such nonmathematical model is not a mathematical equation, but such as tables, trees, such as map data structure. Therefore, it can be said that data structure courses primarily designed to study the issue of nonvalue calculation procedures as a puter operations and the relationship between objects and their operating disciplines. The purpose of the study is to understand the structure of data for puter processing of the identity object to the practical problems involved in dealing with that subject at the puter out and deal with them. At the same time, through training algorithms to improve the thinking ability of students through procedures designed to promote student skills integrated applications and professional qualities.3 the concepts and terminologySystematic study of knowledge in the data structure before some of the basic concepts and terminology to give a precise meaning. Data (Data) is the information carrier, it could be puter identification, storage and processing. It is the puter processing of raw materials, a variety of data processing applications. Computer science, puter processing is the socalled data objects, which can be numerical data can be non numerical data. Numerical data are integer, the actual number or plural, mainly for engineering puting, scientific puting and mercial processing。 致謝本文是在指導(dǎo)老師的大力幫助完成的，他們淵博的知識(shí)和嚴(yán)謹(jǐn)?shù)闹螌W(xué)作風(fēng)使我受益匪淺，對(duì)順利完成本系統(tǒng)起到了極大的作用。 ⑤ 通過(guò)畢業(yè)設(shè)計(jì)，培養(yǎng)了我嚴(yán)肅認(rèn)真的作風(fēng)，逐步建立正確的生產(chǎn)觀念、經(jīng)濟(jì)觀念和全局觀念。培養(yǎng)獨(dú)立思考，深入研究，分析問(wèn)題、解決問(wèn)題的能力。通過(guò)畢業(yè)設(shè)計(jì)的鍛煉，學(xué)到了很多東西： ① 鞏固和加深了對(duì)數(shù)據(jù)結(jié)構(gòu)的理解，提高綜合運(yùn)用本課程所學(xué)知識(shí)的能力。堆排序和快速排序差不多，屬于同一個(gè)數(shù)量級(jí)。這八種算法中，快速排序比較和移動(dòng)的次數(shù)是最少的。 鏈表排序運(yùn)行狀態(tài) 鏈表排序運(yùn)行結(jié)果點(diǎn)擊基數(shù)（MSD）排序按鈕，并點(diǎn)擊開始按鈕，進(jìn)入基數(shù)（MSD）。 歸并排序運(yùn)行狀態(tài) 歸并排序運(yùn)行結(jié)果點(diǎn)擊堆排序按鈕，并點(diǎn)擊開始按鈕。 快速排序運(yùn)行狀態(tài) 快速排序運(yùn)行結(jié)果點(diǎn)擊選擇排序按鈕，并點(diǎn)擊開始按鈕。 直接插入排序過(guò)程界面 直接排序運(yùn)行結(jié)果點(diǎn)擊折半插入排序按鈕，并點(diǎn)擊開始按鈕。 if (isGo = 0) { msdToShowForLast(data, temp,index)。 (30)。 //代碼跟隨 ().setSelectIndexs(new int[]{16})。 (30)。 temp[pos][order[pos]] = data[i]。 } //代碼跟隨 ().setSelectIndexs(new int[]{15})。 if (power ()) { pos = (int) (power) 97。 i++) { if (data[i] == null || .equals(data[i])) break。 for (int i = 0。實(shí)現(xiàn)代碼如下：