![]() | 会員なら、この商品は10%Amazonポイント還元 (ポイントが表示されている場合は、表示ポイント+10%還元)。 |
Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley.
登録情報
|
I found that the books about Data structures & algorithm are always given a not-so-good review, because it doesn't show enough code example or for being too academic. However, this one really deserved 5 stars from me.
The code examples are very good and easy-to-understand for any intermediate C++ programmer (and, of course, for any advenced C++ programmer). So, you can easily use this book for self-study (a lot of people said that his previous book, the one I mentioned above, doesn't suit for self-study, dued to being too-academic). And moreover, the code in this book is true to its name "using C++".
All codes examples are written in real C++, no C-style code fragment here! And with the ability of the Standard Template Library (not all example, only the suitable one). For example : the STL's priority_queue container class was used in Dijkstra's shortest path algorithm, and that is the way it should be implement.
Last word I wish to say about this book is, "It is clearly one of the best book on Data Structures, Algorithms, C++ and How-To-Use C++ I've read so far."
Thank you, Mr.Weiss. Keep up a good work. I hope this one will get even better in its next edition.
I found that the books about Data structures & algorithm are always given a not-so-good review, because it doesn't show enough code example or for being too academic. However, this one really deserved 5 stars from me.
The code examples are very good and easy-to-understand for any intermediate C++ programmer (and, of course, for any advenced C++ programmer). So, you can easily use this book for self-study (a lot of people said that his previous book, the one I mentioned above, doesn't suit for self-study, dued to being too-academic). And moreover, the code in this book is true to its name "using C++".
All codes examples are written in real C++, no C-style code fragment here! And with the ability of the Standard Template Library (not all example, only the suitable one). For example : the STL's priority_queue container class was used in Dijkstra's shortest path algorithm, and that is the way it should be implement.
Last word I wish to say about this book is, "It is clearly one of the best book on Data Structures, Algorithms, C++ and How-To-Use C++ I've read so far."
Thank you, Mr.Weiss. Keep up a good work. I hope this one will get even better in its next edition.