<< 1 >>
Rating: 
Summary: A very deceiving book
Review: Having read excellent John Wiley books in the past, I had great expectations from Ready-to-Run Delphi 3.0 Algorithms. Unfortunately, this book is far from being a good book. First of all, the author, Rod Stephens, is not a Delphi programmer. He merely ported, or more precisely attempted to port, one of his previous Visual Basic books to Delphi. Several Delphi code listings contain code that is... Visual Basic code!Furthermore, the title is totally inappropriate: none of the supplied code is "ready-to-run." In part because it contains too many errors, but more importantly because the sample code is too academic to be really useful in a real life application. Do not waste your money on this title.
Rating: 
Summary: Interesting reference book
Review: I found this book interesting, and at times a pretty hard slog, to read. It covers all the common programming problems such as searching, sorting, stacks, ques etc. Although the book says it is for Delphi 3, the code is generic and would work equally on later versions. I have yet to use some of the code in my own programs but I found some of his thoughts interesting, especially recursion eg. most books would use it for binary searches or factorials but as he states it would run much more efficiently by placing it in a simple loop!, a fact that most other discussions fail to recognise. He points out that while one approach may be suitable for some problems you should realise that sometimes what is a 'less efficient' approach may be better eg. don't use hashing or binary searches on short lists, exhaustive is better. It is a book that most programmers will be able to 'do without' but if you think you may need to do some of the things discussed in the book, it is probably worthwhile thinking of getting a copy.
Rating:
Summary: Interesting reference book
Review: I found this book interesting, and at times a pretty hard slog, to read. It covers all the common programming problems such as searching, sorting, stacks, ques etc. Although the book says it is for Delphi 3, the code is generic and would work equally on later versions. I have yet to use some of the code in my own programs but I found some of his thoughts interesting, especially recursion eg. most books would use it for binary searches or factorials but as he states it would run much more efficiently by placing it in a simple loop!, a fact that most other discussions fail to recognise. He points out that while one approach may be suitable for some problems you should realise that sometimes what is a 'less efficient' approach may be better eg. don't use hashing or binary searches on short lists, exhaustive is better. It is a book that most programmers will be able to 'do without' but if you think you may need to do some of the things discussed in the book, it is probably worthwhile thinking of getting a copy.
Rating:
Summary: Lots of information, but a little confuse
Review: You really find many things here: stacks, lists, trees etc... But the code is not very clear. And they use pointers a lot. Some simulations would be good too...
Rating:
Summary: Lots of information, but a little confuse
Review: You really find many things here: stacks, lists, trees etc... But the code is not very clear. And they use pointers a lot. Some simulations would be good too...
<< 1 >>
| 
