This is my self-study page for the book, "Introduction to Algorithm", or commonly known as CLRS. This is also my diary page of how I struggle and grow in the programming world. I hope this blog can help amateurs or professionals, to improve their skills in programming, learning and living. As of Sep 12, 2011, I finished the "exercise read" of Chapter 2 (20110518) and 3 (20110608) and half of Chapter 4.
Shortcut for chapter specific information
Chapter4
(62)
chapter3
(41)
Chapter2
(22)
chapter6
(10)
chapter12
(9)
chapter15
(8)
chapter13
(7)
chapter7
(7)
Chapter10
(5)
chapter5
(5)
Appendix A
(4)
chapter8
(4)
Chapter19
(3)
Chapter22
(3)
Chapter34
(3)
Chapter35
(3)
chapter11
(3)
chapter16
(3)
chapter18
(3)
Appendix C
(2)
Chapter21
(2)
Chapter25
(2)
Chapter26
(2)
Chapter27
(2)
Chapter28
(2)
Chapter29
(2)
Chapter9
(2)
chapter14
(2)
chapter20
(2)
chapter23
(2)
chapter24
(2)
chapter30
(2)
chapter31
(2)
chapter32
(2)
Appendix D
(1)
Chapter1
(1)
Chapter33
(1)
chapter17
(1)
Tuesday, January 22, 2013
Status at 20130122
I went through Chapter 6 again. I still feel some kind of disharmony in it. Especially when I compare heap with binary tree. There are something deeply mathematical I don't grok.
But I decide to move on (again).
Browse reading: (2nd time) 170/1144
Exercises up to 6-1.2. (Skipped Chapter 4 and 5)
Revisit : 4.2-{3-5}, 4-4.3 after section 4.5, revisit Chapter 4 and 5
when time allowed.
Checking : up to P2.1
Needs write up: 2-3.7 (nice solution using merging), P2.1c, 3-2.4,
3-2.8, P3.1
Exercises checked: 2.1-2, 2.1-3, 2.2-{1,4}, 2.3-{3,7}
Exercises which are finished but not on paper: 1.1-2, 1.2-2, 1.2-3,
P1-1, The whole Section 4.4 except 4.4-3, 4.5-{1,3}, P4.4(a-c), P4.6b,
5.1-{1,2}, whole Section 6.1, 6.2-{1,2,4,5,6}, 6.3-1, 6.4-1 whole
Section 7.1, 7.2-{1-5}, whole Section 7.3 and 7.4.{2,3}, 8.2-1, 8.3-1,
8.3-4, , 10.1-{1-4,6,7}, 10.2-{1,2,6,7}, 12.1-{1,2,3,4}
12.2-{1,2,3,5,6},12.3-{2-4} 12.4-4, P12-1a, P12.4(a),13.2-2, 15-1.1,
15.1-3, 15.3-3, 15.5, 17-1.1, 18.1-1, 18.1-2, 18.2-1, 21-1.1, 21-1.2,
22-1.{1-3,6,7}, 23.1-1 and 23.1-3, P30-1{a,b}, P30-2b, 30-1.1,
31-1.{1-7}, 32.1-{1,2}, 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.
Second Browse Read So Far......
Not doing great and I am still stuck at Chapter 6.
In fact, I have pretty stopped for the whole last year on algorithm study. Shame on me!
Now saying so, there is something which makes me mentally stuck or simply just getting slower when I try to absorb anything in Chapter 6 to Chapter 9. When I analyzed myself, the reason is
In my work, I start to need to think deeply in terms of algorithm again. I believe it means this blog should be reactivated.
Let's restart! And work on each of these issues slowly.
33_P
In fact, I have pretty stopped for the whole last year on algorithm study. Shame on me!
Now saying so, there is something which makes me mentally stuck or simply just getting slower when I try to absorb anything in Chapter 6 to Chapter 9. When I analyzed myself, the reason is
- I don't have a C linked list package or a tree package at my disposal: Shame on me, because it's never difficult to write one.
- Like sorting, some of the algorithms need to test in practice before I truly grok.
- Also, 1 year after my first browse read, my memory has significantly faded on some material.
- I should start to package all my previous algorithm. It's worthwhile to continue to improve on them. But I didn't so my memory was disrupted.
- I need to express myself mathematically but I never figure out how to write mathematical equations on Blogger. Shame on me, that's why things are slow growing.
In my work, I start to need to think deeply in terms of algorithm again. I believe it means this blog should be reactivated.
Let's restart! And work on each of these issues slowly.
33_P
Subscribe to:
Posts (Atom)