Ask HN: After SICP, what next?

Post by zain » Fri, May 15, 2009, 10:38 PM UTC

dschobel wrote: post #8

This is the single best text I've seen on algorithms in the real-world: http://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/d... Can't recommend it enough.

Post by pkrumins » Sat, May 16, 2009, 1:29 AM UTC

zain wrote: post #32

dschobel wrote: post #8

This is the single best text I've seen on algorithms in the real-world: http://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/d... Can't recommend it enough.

Here's the second edition from 2008: http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/...

Post by gilesgoatboy » Sat, May 16, 2009, 7:14 AM UTC

notaddicted wrote: post #27

chollida1 wrote: post #24

Earlier quoted context omitted.

Sorry if this seems dense but I can't reconcile what your saying and I've not read the book. You say: > It's actually a common misconception that Knuth uses MIX/MMIX to implement his algorithms. So you state very clearly that he doesn't use MIX to code his algorithms. But then you say: > and the MMIX implementation is usually only given when there are relevant implementation details to be discussed So you say that he…

Yes, that is how it is. For example the first algorithm in the book (found via google): Algorithm E ( Euclid's algorithm). Given two positive integers m and n, find their greatest common divisor, that is, the largest positive integer that evenly divides both m and n. E1 [Find remainder.] Divide m by n and let r be the remainder. (We will have 0 ≤ r E2 [Is it zero?] If r=0, the algorithm terminates: n is the answer. E…