I was able to break my reading block on heap sort. Then I cruised through chapter 7 on quick sort and come to chapter 8. I believe 6, 7, 8 are advanced topics which require good background in theory. So reread is necessary. There are topics which I feel blurry - that include priority queue and the analysis of quick sort. Those are very important but not easy to fully understand.
I also reread the material about merge sort and Chapter 3 again. Now I get them. My mind just wasn't ready for them. In fact, this is a very good book to own because once you finished Chapter 2 and drill it seriously. You already know 4 basic comparison sorting algorithm by heart, one even has performance in theta(nlogn).
Browse Read: 200/1144
Exercises up to 2.2-3
33_P
(Correction: there are only 1144 pages in the 3rd edition.)
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)
No comments:
Post a Comment