Donald E.Knuth 算法和程序設(shè)計(jì)技術(shù)的先驅(qū)者，是計(jì)算機(jī)排版系統(tǒng)TEX和METAFONT的發(fā)明者。 Donald.E.Knuth（唐納德.E.克努特，中文名高德納）是斯坦福大學(xué)計(jì)算機(jī)程序設(shè)計(jì)藝術(shù)的榮譽(yù)退休教授，Knuth教授獲得了許多獎(jiǎng)項(xiàng)和榮譽(yù)，包括美國計(jì)算機(jī)協(xié)會(huì)圖靈獎(jiǎng)（ACM Turing Award），美國前總統(tǒng)卡特授予的科學(xué)金獎(jiǎng)（Medal of Science），美國數(shù)學(xué)學(xué)會(huì)斯蒂爾獎(jiǎng)（AMS Steele Prize），以及1996年11月由于發(fā)明先進(jìn)技術(shù)榮獲的極受尊重的京都獎(jiǎng)（KyotoPrize）。他因這些成就和大量創(chuàng)造性的影響深遠(yuǎn)的著作（19部書和160篇論文）而譽(yù)滿全球。
圖書目錄
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 by 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 cascade 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 bibliography chapter 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 keys answers to exercises appendix a tables of numerical quantities 1. fundamental constants (decimal) 2. fundamental constants (octal) 3. harmonic numbers, bernoulli numbers, fibonacci numbers appendix b index to notations index and glossary
鄂公網(wǎng)安備 42010302001612號(hào) 