The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams (Paperback)

Donald E. Knuth

  • 出版商: Addison Wesley
  • 出版日期: 2009-03-01
  • 售價: $1,020
  • 貴賓價: 9.5$969
  • 語言: 英文
  • 頁數: 272
  • 裝訂: Paperback
  • ISBN: 0321580508
  • ISBN-13: 9780321580504
  • 相關分類: R 語言
  • 立即出貨

買這商品的人也買了...

商品描述

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth’s writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.

 

To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.

 

Volume 4, Fascicle 1

This fascicle, enlivened by a wealth of Knuth’s typically enjoyable examples, describes basic “broadword” operations and an important class of data structures that can make computer programs run dozens–even thousands–of times faster. The author brings together and explains a substantial amount of previously scattered but eminently practical information known only to a few specialists. The book also includes nearly five-hundred exercises for self-study, with detailed answers given in nearly every case; dozens of these exercises present original material that has never before been published. Simply put, this fascicle is a must-have for anybody who is faced with tough problems of a combinatorial flavor. It demonstrates how ordinary programmers can make use of powerful techniques that heretofore seemed to be available only to people who used specialized languages and software. It shows how ideas once thought to be “far out” are now ready to become a part of the programming mainstream.

商品描述(中文翻譯)

這部關於算法分析的多卷作品長期以來一直被認為是經典計算機科學的權威描述。迄今為止已經出版的三卷完整內容已經成為編程理論和實踐中獨特且寶貴的資源。無數讀者談到了Knuth的著作對他們的深遠影響。科學家對他的分析的美麗和優雅感到驚嘆,而實踐編程人員則成功地將他的“食譜”解決方案應用於日常問題。所有人都欣賞Knuth在他的書中所展現的廣度、清晰度、準確性和幽默感。

為了開始這套書的第四卷和後續卷的編寫,並更新現有三卷的部分內容,Knuth創作了一系列稱為fascicles的小書,將定期出版。每個fascicle將包含一個或多個全新或修訂的部分。最終,這些fascicles的內容將被整合到每個卷的全面最終版本中,這項從1962年開始的巨大工程將會完成。

這個fascicle以Knuth典型的有趣例子為特色,描述了基本的“broadword”操作和一個重要的數據結構類別,可以使計算機程序運行數十甚至數千倍更快。作者匯集並解釋了大量以前分散但非常實用的信息,這些信息只有少數專家才知道。該書還包括近五百個自學習題,幾乎每個題目都有詳細的答案;其中幾十個練習題提供了以前從未發表過的原創材料。簡而言之,這個fascicle對於面臨組合類型的困難問題的人來說是必不可少的。它展示了普通程序員如何利用強大的技術,這些技術以前似乎只適用於使用專門語言和軟件的人。它展示了曾經被認為是“遙不可及”的想法現在已經準備好成為編程主流的一部分。