My reading goes slowly. Finished all exercises at 2-2. Writing proofs and solving exercises are always mind-provoking. I also found that seriously read through heap sort takes some mental power.
Ex 2-1.3 is a trivial problem with a very simple pseudocode answer. Though writing a good proof is a tougher problem. I might put my proof here and see how wrong it is.
Ex 2-1.4 reminds me my class in logic design. At the end of the day, my solution still requires defining sub-routines of XOR and NOT. It seems to me they are necessary.
-Browse reading : 150/1144.
-Exercise up to 2-2.1.
No comments:
Post a Comment