Lecture 5: (quick, personal summary) In lecture 5, I finished up on efficiency of algorithms -- re-iterated the idea of analyzing the dominant operation using the theta-notations. Then covered efficiency analysis of Pattern-Match algorithm, introduced
Read More...
Lecture 3: (quick, personal summary) In lecture 3, we finally get to talk about algorithms -- the primitives, with examples. We also covered simple algorithms (sum), the basic structure of an iterative loop, and a simple sequential search -- but I did
Read More...