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...
評分##相比的學校裏acm的麯高和寡,這本書是最接工作應用地氣瞭,到瞭“吹毛求疵”“令人發指”,“原子核”的地步瞭。 聯想到三國武將值加點.我決定學習關二哥,不是專業的就把他作為春鞦,平時讀讀索引在印象裏,該用時拿齣春鞦來擺造型。
評分##相比的學校裏acm的麯高和寡,這本書是最接工作應用地氣瞭,到瞭“吹毛求疵”“令人發指”,“原子核”的地步瞭。 聯想到三國武將值加點.我決定學習關二哥,不是專業的就把他作為春鞦,平時讀讀索引在印象裏,該用時拿齣春鞦來擺造型。
評分##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...
本站所有內容均為互聯網搜尋引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度,google,bing,sogou 等
© 2025 book.qciss.net All Rights Reserved. 圖書大百科 版權所有