|
fox racing money clip
|
#
¿
Jun 3, 2016 11:16
|
|
|
|
| # ¿ Apr 29, 2024 06:19 |
|
|
This is a review from a person who prefer writing summaries over doing problem sets and read only one book per topic for interest. I believe most people buy this book for its face value and yes that perhaps will give it a five star (no that I care about its face value as I am not a CS major). I rated this book with one star so that the people who really want to read this book would see. And as to today's stand point, one star is relevant in sense of its priorities in learning algorithms. I throw away these books a month later trying to make it a habit reading it a little every weekday morning. I started with the from the beginning, and it would be impossible otherwise without learning the language it uses. However, the language is outdated, which is even noted by the author saying that it'd be nice if some one update it. An old language is not too bad, since many ideas in algorithms should be language independent. Nonetheless, the printout format is for punch cards. Unless, someone is nostalgic in organizing punch card in a manner that covers 1/3 of code, then all right, the book should be for you. Yes, you may do what I did by ignoring the printout over all. However, my impression after reading the delicate chapter only on punch cards is that the later codes will be heavily entangled with such format. The author does argues that perhaps learning old languages may turn out to be useful at some point. I don't like this attitude compare to "this part is tedious, skip it unless you just have too much time with you" (yes, there are authors that do say this). And there, I drop the book. There are other things that worth mentioning. When introducing the language (I don't have the book anymore and so I don't quite remember what's it's called) and its operations, some behaviors under special conditions are left out, and so you cannot completely determine the result of some operation is weird cases base on the chapter along, and they are only vaguely mentioned by the solution of the exercises. Along with some typos in the examples, it's easy to lose the overall behavior of the code. So yes, to appropriately understand this book, reading it is not sufficient; you get to play around with it on an actual computer. The chapter that I think may worth keeping it is actually the math chapter and their associated calculation for the efficiency of the algorithms. I had not seen enough theorem dealing with complicated operation with sigma sums and pi products, and I didn't go through all the calculation, but after all, the math may be the most relevant thing today as it's definitely language independent. I get to read concrete math to check if the same things show up there. So yes, in case you want it on your shelf, don't read it with too much effort, unless you are interested in updating the whole set of books.
|
|
#
¿
Jun 4, 2016 09:18
|
|
|
nmn's chome w as best
|
|
#
¿
Jul 1, 2016 00:33
|
|
|
|
|
#
¿
Jul 15, 2016 21:12
|
|