http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11866
I spend a lot of time lurking in the #PHP channel (efnet and freenode, please - no flamewars) and this topic is a commonly asked one that usually gets a simplified answer in the form of using strpos(), or at best an ip2long() in a greater than and less than answer. Unfortunately although people usually understand that an IP address is simply an unsigned 32 bit integer, and is easily determined, us...
Sorting - The most fundamental thing in algorithms, and it's almost a given. (And it means the same in English as it does in Math, so no explanations needed, I hope.) There are tons of crazy sorts out there, but quick sort is the one everyone should be familiar with, merge sort is the one that comes in handy when you can't fit everything into RAM, and introspective sort is important to lea...
本帖最后由 e_guo123d 于 2011-09-19 23:35 编辑 粗略看完了第二部分，现在回头过来看第二遍，自己实现书中的算法，并努力做完每一个练习题，在此过程中有很多问题需要和人讨论，发到这的话就太多了，还有发现了书上的一些错误，现在希望找人实时交流一下，有没有人也在看这本书？可以站内短信或者跟贴留下联系方式。一起努力，一起进步。
CPS 238 I/O-Efficient algorithms Summary of Lectures and List of Material Go to list of material Lec. Date Topic Reading 1 Jan 8 Introduction: Hierarchical memory, I/O-bottleneck, I/O-model, fundmental bounds Sorting: Merge and distribution sort [ AV ] sec 3+5 [ Agis ] sec 1, 2, 3.1-3.2, [ AL ] 2-3 Jan 15 Lower bounds: Sorting and searching Searching: B-trees, [ Mehlhorn...
I/O-algorithms, Spring 2006 Description: In many modern applications that deal with massive data sets, communication between internal and external memory, and not actual computation time, is the bottleneck in the computation. This is due to the huge difference in access time of fast internal memory and slower external memory such as disks. In order to amortize this time over a large amount of da...
