數(shù)據(jù)結(jié)構(gòu)與算法分析

內(nèi)容概要

　　 本書采用程序員最愛用的面向?qū)ο驝++語言來描述數(shù)據(jù)結(jié)構(gòu)和算法，并把數(shù)據(jù)結(jié)構(gòu)原理和算法分析技術(shù)有機(jī)地結(jié)合在一起，系統(tǒng)介紹了各種類型的數(shù)據(jù)結(jié)構(gòu)和排序、檢索的各種方法。作者非常注意對(duì)每一種數(shù)據(jù)結(jié)構(gòu)的不同存儲(chǔ)方法及有關(guān)算法進(jìn)行分析比較。書中還引入了一些比較高級(jí)的數(shù)據(jù)結(jié)構(gòu)與先進(jìn)的算法分析技術(shù)，并介紹了可計(jì)算性理論的一般知識(shí)。本版的重要改進(jìn)在于引入了參數(shù)化的模板，從而提高了算法中數(shù)據(jù)類型的通用性，支持高效的代碼重用。    本書適合作為大專院校計(jì)算機(jī)軟件專業(yè)與計(jì)算機(jī)應(yīng)用專業(yè)學(xué)生的雙語教學(xué)教材和參考書，也適合計(jì)算機(jī)工程技術(shù)人員參考。

書籍目錄

Ⅰ PRELIMINARIES  1  Data Structures and Algorithms    1.1  A Philosophy of Data Structures      1.1.1  The Need for Data Structures      1.1.2  Costs and Benefits    1.2  Abstract Data Types and Data Structures    1.3  Problems, Algorithms, and Programs    1.4  Further Reading    1.5  Exercises  2  Mathematical Preliminaries    2.1  Sets and Relations    2.2  Miscellaneous Notation    2.3  Logarithms    2.4  Recursion    2.5  Summations and Recurrences    2.6  Mathematical Proof Techniques      2.6.1  Proof by Contradiction      2.6.2  Proof by Mathematical Induction    2.7  Estimating    2.8  Further Reading    2.9  Exercises  3  Algorithm Analysis    3.1  Introduction    3.2  Best, Worst, and Average Cases    3.3  A Faster Computer, or a Faster Algorithm?    3.4  Asymptotic Analysis       3.4.1  Upper Bounds       3.4.2  Lower Bounds       3.4.3  Notation       3.4.4  Simplifying Rules    3.5  Calculating the Running Time of a Program    3.6  Analyzing Problems    3.7  Common Misunderstandings    3.8  Multiple Parameters    3.9  Space Bounds    3.10  Some Practical Considerations    3.11  Further Reading    3.12  Exercises    3.13  ProjectsⅡ  FUNDAMENTAL DATA STRUCTURESⅢ  Sorting and SearchingⅣ  Applications and Advanced TopicsⅤ  APPENDIXA Utility FunctionsBibliographyIndex

圖書封面

圖書標(biāo)簽Tags

無

評(píng)論、評(píng)分、閱讀與下載

---

    數(shù)據(jù)結(jié)構(gòu)與算法分析 PDF格式下載

---