Mark Schoonover wrote:
Well, it's going slow - atleast for me. Partially because of outside influences. I'm currently working through section 2.3.2, but I'll tell you, Lisp is starting to drive me a bit batty. Maybe I should stop SICP, and actually learn Lisp.
Then I recommend "The Little Schemer" and "The Seasoned Schemer". They look silly, but just do the exercises. They tend to be in byte-sized chunks that you can do at your own speed.
In addition, they give you a about 10 rules (commandments) to help you dig your way through designing Scheme programs.
I'm thinking I could be fighting previously learned habits from learning assembly, Pascal, C and Perl that Lisp is sufficiently foreign enough that I'm not able to understand what the code is telling me.
It is not just you. Many people complain about the impedance mismatch between Lisp and algorithms. Lisp maps to recursive/tree algorithsm very well. Iterative and decision algorithms, not so much.
Of course, doing tree-based algorithms in Java and C tends to be a painful experience.
The concepts are coming along just fine, and I really liked how they wrote about the mapping construct. I've used that in Perl, but not all that often. Now I see where I could have applied that construct in ways I came up with a different solution.
Yeah, mapping is *very* powerful. -a -- [email protected] http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-lpsg
