Prompted by Semagic (yet again)

(I should really make this a more common thing...)

Happy birthday to neurosis, even though she probably doesn't remember me. ^^;

(no subject)

Eric Lippert blogs about dynamic programming and memoization, with reference to the Fibonacci sequence and algorithms for finding the longest common sequence (with the same order) within two arrays (or strings).

This is something that was taught in my Data Structures and Algorithm course (CS1102), but it wasn't really covered in depth, mostly because it's also covered in other courses (such as competitive programming) which a majority of the people taking this course won't want to do.

That being said, I feel this particular area should be covered more, because it can result in more efficient programs, even at the cost of increased memory usage.