Status 20110612

After some rest, I decided to put my head in the maximum subarray problem.  It's one of the problem which put me in shame in programming interview.   

But this time I think I get a grip of the problem.  In fact one of the key when you solve a problem like this is to always break it down to a subproblem and try to understand the relationship between the problem and the subproblems. I tried to break down the problem by either divide and conquer and DP.  Both gave me different answers. Unfortunately, both are wrong as well but it makes understand Section 4.1 and 4.2 very quickly.  With the hint, I was also able to work out 4.1-5 which is a linear algorithm of the maximum subarray problem.  I am quite satisfied.

Finished in my head: 4.1-1, 4.1-2, 4.1-5, 4.2-6, 4.2-7

Fuzzy reading: 414/1144
Browse reading: 309/1144
Exercises up to 4-1.1

Needs write up: P2.1c, 3-2.4, 3-2.8, P3.1

Exercises which are finished but not on paper: 1.1-2, 1.2-2, 1.2-3, P1-1, 4.1-1, 4.1-2, 4.1-5, 4.2-6, 4.2-7, 4.3-{1,2,4,5,6}, The whole Section 4.4, 4.5-1, P4.4(a-c), 5.1-{1,2}, whole Section 6.1, 6.2-{1,2,4,5,6}, 6.3-1, 10.1-6, 10.1-7, 12.1-{1,2,4} 12.2-{2.3}, 12.4-4, P12.4(a), 15-1.1, 15.1-3, 15.3-3, 15.5, A.1-{1,2,3,4,5,7},  C.1-{2,4,5,7,8,9,14}, C.2-{1,2,4,5}, C.3-{1,2,10}, all in D.1. and D.2-2