Art of Computer Programming ─ Combinatorial Algorithms
商品資訊
ISBN13:9780201038040
出版社:Addison-Wesley Professional
作者:Donald E. Knuth
出版日:2011/01/12
裝訂/頁數:平裝/883頁
規格:24.1cm*17.8cm*5.1cm (高/寬/厚)
定價
:NT$ 3600 元優惠價
:
90 折 3240 元
無庫存,下單後進貨(到貨天數約30-45天)
下單可得紅利積點 :97 點
商品簡介
作者簡介
商品簡介
This first volume begins with basic programming concepts and techniques, then focuses on information structures---the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design.
The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis.
The third volume comprises the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume I to consider both large and small databases and internal and external memories.
This volume introduces techniques that allow computers to deal efficiently with gigantic problems. Its coverage begins with Boolean functions and bitwise tricks and techniques, then treats in depth the generation of all tuples and permutations, all combinations and partitions, and all trees.
The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis.
The third volume comprises the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume I to consider both large and small databases and internal and external memories.
This volume introduces techniques that allow computers to deal efficiently with gigantic problems. Its coverage begins with Boolean functions and bitwise tricks and techniques, then treats in depth the generation of all tuples and permutations, all combinations and partitions, and all trees.
作者簡介
Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the TEX and METAFONT systems for computer typesetting, and for his prolific and influential writing (26 books, 161 papers). Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of his seminal multi-volume series on classical computer science, begun in 1962 when he was a graduate student at California Institute of Technology. Professor Knuth is the recipient of numerous awards and honors, including the ACM Turing Award, the Medal of Science presented by President Carter, the AMS Steele Prize for expository writing, and, in November, 1996, the prestigious Kyoto Prize for advanced technology. He lives on the Stanford campus with his wife, Jill.
主題書展
更多
主題書展
更多書展購物須知
外文書商品之書封,為出版社提供之樣本。實際出貨商品,以出版社所提供之現有版本為主。部份書籍,因出版社供應狀況特殊,匯率將依實際狀況做調整。
無庫存之商品,在您完成訂單程序之後,將以空運的方式為你下單調貨。為了縮短等待的時間,建議您將外文書與其他商品分開下單,以獲得最快的取貨速度,平均調貨時間為1~2個月。
為了保護您的權益,「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨,請在商品鑑賞期內寄回,且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。

