h2134的专栏

THE WORLD’S TECHNOLOGICAL CAPACITY TO STORE, COMMUNICATE, AND COMPUTE INFORMATION

mobi格式

高性能MySQL英文第三版，mobi格式

Summary of the Most Significant Changes in the Third Edition The third edition incorporates numerous bug fixes, and many parts of the book have undergone revision to increase the clarity of presentation. In addition, Chapter 4 includes implementation of the AVL tree deletion algorithm—a topic often requested by readers. Chapter 5 has been extensively revised and enlarged and now contains material on two newer algorithms: cuckoo hashing and hopscotch hashing. Additionally, a new section on universal hashing has been added. Chapter 7 now contains material on radix sort, and a new section on lower bound proofs has been added. Chapter 8 uses the new union/find analysis by Seidel and Sharir, and shows the O( Mα(M,N) ) bound instead of the weaker O( Mlog∗ N ) bound in prior editions. Chapter 12 adds material on suffix trees and suffix arrays, including the linear-time suffix array construction algorithm by Karkkainen and Sanders (with implementation). The sections covering deterministic skip lists and AA-trees have been removed. Throughout the text, the code has been updated to use the diamond operator from Java 7.

数据结构与算法分析：C语言描述(第二版高清)

the_c_programming_language第二版中文习题答案

国内云计算杂志 程序员：阿里云专刊《凌云》PDF版 追寻凌云梦——对话阿里云总裁王坚