作者：DonaldE.Knuth
出版社：Addison-WesleyProfessional
副标题：CombinatorialAlgorithms,Part1
出版年：2011-1-22
页数：912
定价：$74.99
装帧：Hardcover
丛书：TheArtofComputerProgramming
ISBN：9780201038040
内容简介 ······
The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer’s library.
作者简介 ······
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 multivolume 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.
评论 ······
读了一小部分，除了 bitwise tricks比较好懂，其它的部分都是看多以后觉得被人打了一拳的感觉，特别多的技巧要去领会。没读完，不打算读了。排版的人肯定很烦，牌九骰子64卦的图片都要弄。
原版收藏
感觉比前三本难懂 看了以后发现自己根本不会数数
本科读过两遍 受益匪浅 第四卷尤其有用
