Hacker's Delight

出版者:Addison-Wesley Professional

作者:Henry S. Warren

页数:512

出版时间:2012-10-5

价格:USD 59.99

装帧:Hardcover

isbn号码:9780321842688

图书标签:算法计算机计算机科学编程Hacker's_DelightProgrammingprogramming程序设计

承接 住宅 自建房 室内改造 装修设计 免费咨询 QQ：624617358 一级注册建筑师 亲自为您回答、经验丰富，价格亲民。无论项目大小，都全力服务。期待合作，欢迎咨询！QQ：624617358

In Hacker's Delight, Second Edition, Hank Warren once again compiles an irresistible collection of programming hacks: timesaving techniques, algorithms, and tricks that help programmers build more elegant and efficient software, while also gaining deeper insights into their craft. Warren's hacks are eminently practical, but they're also intrinsically interesting, and sometimes unexpected, much like the solution to a great puzzle. They are, in a word, a delight to any programmer who is excited by the opportunity to improve. Extensive additions in this edition include * A new chapter on cyclic redundancy checking (CRC), including routines for the commonly used CRC-32 code * A new chapter on error correcting codes (ECC), including routines for the Hamming code * More coverage of integer division by constants, including methods using only shifts and adds * Computing remainders without computing a quotient * More coverage of population count and counting leading zeros * Array population count * New algorithms for compress and expand * An LRU algorithm * Floating-point to/from integer conversions * Approximate floating-point reciprocal square root routine * A gallery of graphs of discrete functions * Now with exercises and answers

读后感

Hacker's delight is a interesting book. The only problem is it skiped many steps and hard to follow. For example, one of the topic is how to cout the number of binary 1s for a unsigned interger. 1. Easy answer start from here unsigned int CountBitOne(uns...  

本书讲解的算法，和我参与翻译的那本《算法谜题》，虽然名字差不多，但是讲述的是完全不同的题材。本书讲解的题材，可以说市面上仅此一本（如果不算第一版的话），可以说是唯一一本讲解计算机算法的图书——而其他的算法书，则基本上全部是讲解数学算法的图书。虽然说数学算法...  

Hacker's delight is a interesting book. The only problem is it skiped many steps and hard to follow. For example, one of the topic is how to cout the number of binary 1s for a unsigned interger. 1. Easy answer start from here unsigned int CountBitOne(uns...  

此评论仅限于04机工版，已入英文第2版，不知14版翻译质量 对于 a<x<b 且 c<y<d成立的情况下 P44. 译文:最后，对于a+c产生溢出但b+d不产生溢出的情况，等式成立的理由是a<b且c<d. 原文: Lastly, the case that a+c overflows, but b+d does not, cannot occur, because a < ...  

用户评价

有点像加德纳写的数学科普文章，各种计算（偏底层）的奇技淫巧。搞算法优化和编译器的童稚可以看看。

http://www.itpub.net/thread-1731402-1-1.html

有点像加德纳写的数学科普文章，各种计算（偏底层）的奇技淫巧。搞算法优化和编译器的童稚可以看看。

有点像加德纳写的数学科普文章，各种计算（偏底层）的奇技淫巧。搞算法优化和编译器的童稚可以看看。

http://www.itpub.net/thread-1731402-1-1.html