出版時間:2008-1 出版社:機械工業(yè) 作者:Donald E.Knuth 頁數(shù):780
Tag標簽:無
內容概要
本書英文影印版由Pearson Education Asia Ltd.授權機械工業(yè)出版社獨家出版。未經出版者書面許可,不得以任何方式復制或抄襲本書內容。 僅限于中華人民共和國境內(不包括中國香港、澳門特別行政區(qū)和中國臺灣地區(qū))銷售發(fā)行。 本書封面貼有Pearson Education(培生教育出版集團)激光防偽標簽,無標簽者不得銷售。
作者簡介
Donald E.Knuth(唐納德 E.克努特,中文名高德納)算法和程序設計技術先驅者、計算機排版系統(tǒng)TEX和METAFONT的發(fā)明者,他因這些成就以及大量富于創(chuàng)造力和具有深遠影響的著作(19部書,160篇論文)而譽滿全球。作為斯坦福大學關于計算機程序設計藝術的榮譽退休教授。目前他投
書籍目錄
Chapter 5-Sorting 5.1 Combinatorial Properties of Permutations 5.1.1 Inversions 5.1.2 Permutations of a Multiset 5.1.3 Runs 5.1.4 Tableaux and Involutions 5.2 Internal sorting 5.2.1 Sorting Insertion 5.2.2 Sorting by Exchanging 5.2.3 Sorting by Selection 5.2.4 Sorting by Merging 5.2.5 Sorting by Distribution 5.3 Optimum Sorting 5.3.1 Minimum-Comparison Sorting 5.3.2 Minimum-Comparison Merging 5.3.3 Minimum-Comparison Selection 5.3.4 Networks for Sorting 5.4 External Sorting 5.4.1 Multiway Merging and Replacement Selection 5.4.2 The Polyphase Merge 5.4.3 The Casecade Merge 5.4.4 Reading Tape Backwards 5.4.5 The Oscillating Sort 5.4.6 Practical Considerations for Tape Merging 5.4.7 External Radix Sorting 5.4.8 Two-Tape Sorting 5.4.9 Disks and Drums 5.5 Summary,History,and BibliographyChapter 6-Searching 6.1 Sequential Searching 6.2 Searching by Comparison of Keys 6.2.1 Searching an Ordered Table 6.2.2 Binary Tree Searching 6.2.3 Balanced Trees 6.2.4 Multiway Trees 6.3 Digital Searching 6.4 Hashing 6.5 Retrieval on Secondary KeysAnswers to ExercisesAppendix A-Tablesof Numerical Quantities 1.Fundamental Constants(decimal) 2.Fundamental Constants(Octal) 3.Harmonic Numbers,Bernoulli Numbers,Fibonacci NumbersAppendix B—lndex to NotationsIndex and Glossary
圖書封面
圖書標簽Tags
無
評論、評分、閱讀與下載