Answer from Edwin Chen, Data Scientist at Twitter Suppose you’re very indecisive, so whenever you want to watch a movie, you ask your friend Willow if she thinks you’ll like it. In order to answer, Willow first needs to figure out what movies you like, so you give her a bunch of movies and tell […]

Answer from Alex Kamil Online resources: http://openclassroom.stanford.ed… http://www.topcoder.com/tc?modul… http://courses.csail.mit.edu/6.0… http://news.ycombinator.com/item… http://cslibrary.stanford.edu/ http://algorithms.openmymind.net/ http://www.cs.uiuc.edu/~jeffe/te… http://blog.palantir.com/2011/09… http://www.samba.org/~tridge/phd… http://www.strchr.com/links http://www.cs.sunysb.edu/~skiena… Introductory textbooks: Lafore, Data Structures and Algorithms in Java: http://www.amazon.com/Data-Struc… Harris & Ross, Beginning Algorithms: http://www.amazon.com/Beginning-… Schaum’s Outline of Data Structures with C++: http://www.amazon.com/Schaums-Ou… Sedgewick’s Algorithms in C: http://www.amazon.com/Algorithms… Dasgupta, Papadimitriou & Vazirani, Algorithms: http://www.cs.berkeley.edu/~vazi… Skiena, The Algorithm […]

Answer from Adam D’Angelo, former algorithms TA The ones I generally consider are: LZO (http://www.oberhumer.com/opensou…) – decompression is very, very fast; around 15MB/s on a Pentium 133. – compression depends more on the level you choose, but is around 2MB/s on a Pentium 133. – there is a command-line program called lzop which operates like […]