Flipping Shene's book "Selected Well-Known Problems" is probably the only must-have algorithm book in the Chinese-speaking world. (In case you don't know, yes I speak Chinese.)
I bought the book around 12 years ago during my Master. It's the first book which makes me feel interested in algorithmic study in the first place. It's format is unique. It is not a text book but it extracts famous problem and their latest development.
Prof. Shene is also a big fan of digital camera and principle. Way to go! I am going to read the book again from Chapter 7 to Chapter 9. After that I would have finish a round of browse read.
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)
Showing posts with label Ching-Kuang Shene. Show all posts
Showing posts with label Ching-Kuang Shene. Show all posts
Tuesday, September 6, 2011
Wednesday, May 4, 2011
Merge sort from Prof Shene's book
One of a less well-known book by Prof Ching-Kuang Shene is 名題精選百則:技巧篇. It is presented in C (my favorite) and most of the code are neat.
For example, I found the merge sort in the book is probably the clearest for a merge sort requires an extra memory. That's probably become the merge sort I will write in future.
For example, I found the merge sort in the book is probably the clearest for a merge sort requires an extra memory. That's probably become the merge sort I will write in future.
Subscribe to:
Posts (Atom)