About the Partition Problem (T4-D1) The partition problem (T4-D1) is an example of a thinking problem. You are given a simple statement of the problem and you are asked to find an algorithm for solving the problem. In class, several methods were given
Read More...
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...