- Paperback: 416 pages
- Publisher: John Wiley & Sons; Pap/Cdr edition (11 Aug 1998)
- Language English
- ISBN-10: 0471254002
- ISBN-13: 978-0471254003
- Product Dimensions: 23.2 x 19 x 2.4 cm
- Average Customer Review: 4.0 out of 5 stars See all reviews (1 customer review)
-
Amazon Bestsellers Rank:
1,838,124 in Books (See Top 100 in Books)
- #35 in Books > Computers & Internet > Computer Science > Programming > Languages > Delphi
- See Complete Table of Contents
Did you know you can trade in your old books for an Amazon.co.uk Gift Card to spend on the things you want? Plus, get an extra £5 Gift Certificate when you trade in books worth £10 or more before June 30, 2012. Visit the Books Trade-In Store for more details. |
Product details |
More About the Author
Product Description
Product Description
All the algorithms you′ll ever need for use in your Delphi programs
Ready–to–Run Delphi 3.0 Algorithms
This book/CD package arms you with a library of powerful algorithms completely implemented in Delphi source code. Just as importantly, it shows you when, where, and how to use them, and when you shouldn′t use them. You′ll find out how to handle just about any design requirement you′ll encounter, such as managing data structures, sorting, searching, hashing, networking, and other important program functions.
In plain English, and with the help of sample code and numerous working examples, programming guru Rod Stephens brings you up to speed on algorithm fundamentals, and, with the help of ready–to–run programs that you can use to try out the algorithms, he shows you how to:
∗ Compare the strengths and weaknesses of different algorithms to select the best one for a particular situation
∗ Analyze algorithms both theoretically and in real–world situations
∗ Anticipate performance problems before they become disasters
∗ Customize algorithms to suit your particular needs
∗ Effectively use both classical algorithms and the latest object–oriented techniques
∗ Identify performance bottlenecks where changes can have the greatest impact on speed
The CD–ROM supplies you with:
∗ Delphi source code for all the algorithms described in the book
∗ Test programs to try them out
∗ A library of important algorithms you can use immediately without wasting valuable programming time
Visit the author′s comprehensive Delphi site at :www.delphi–helper.com
Ready–to–Run Delphi 3.0 Algorithms
This book/CD package arms you with a library of powerful algorithms completely implemented in Delphi source code. Just as importantly, it shows you when, where, and how to use them, and when you shouldn′t use them. You′ll find out how to handle just about any design requirement you′ll encounter, such as managing data structures, sorting, searching, hashing, networking, and other important program functions.
In plain English, and with the help of sample code and numerous working examples, programming guru Rod Stephens brings you up to speed on algorithm fundamentals, and, with the help of ready–to–run programs that you can use to try out the algorithms, he shows you how to:
∗ Compare the strengths and weaknesses of different algorithms to select the best one for a particular situation
∗ Analyze algorithms both theoretically and in real–world situations
∗ Anticipate performance problems before they become disasters
∗ Customize algorithms to suit your particular needs
∗ Effectively use both classical algorithms and the latest object–oriented techniques
∗ Identify performance bottlenecks where changes can have the greatest impact on speed
The CD–ROM supplies you with:
∗ Delphi source code for all the algorithms described in the book
∗ Test programs to try them out
∗ A library of important algorithms you can use immediately without wasting valuable programming time
Visit the author′s comprehensive Delphi site at :www.delphi–helper.com
From the Back Cover
All the algorithms you′ll ever need for use in your Delphi programs
Ready–to–Run Delphi 3.0 Algorithms
This book/CD package arms you with a library of powerful algorithms completely implemented in Delphi source code. Just as importantly, it shows you when, where, and how to use them, and when you shouldn′t use them. You′ll find out how to handle just about any design requirement you′ll encounter, such as managing data structures, sorting, searching, hashing, networking, and other important program functions.
In plain English, and with the help of sample code and numerous working examples, programming guru Rod Stephens brings you up to speed on algorithm fundamentals, and, with the help of ready–to–run programs that you can use to try out the algorithms, he shows you how to:
∗ Compare the strengths and weaknesses of different algorithms to select the best one for a particular situation
∗ Analyze algorithms both theoretically and in real–world situations
∗ Anticipate performance problems before they become disasters
∗ Customize algorithms to suit your particular needs
∗ Effectively use both classical algorithms and the latest object–oriented techniques
∗ Identify performance bottlenecks where changes can have the greatest impact on speed
The CD–ROM supplies you with:
∗ Delphi source code for all the algorithms described in the book
∗ Test programs to try them out
∗ A library of important algorithms you can use immediately without wasting valuable programming time
Visit the author′s comprehensive Delphi site at :www.delphi–helper.com
Ready–to–Run Delphi 3.0 Algorithms
This book/CD package arms you with a library of powerful algorithms completely implemented in Delphi source code. Just as importantly, it shows you when, where, and how to use them, and when you shouldn′t use them. You′ll find out how to handle just about any design requirement you′ll encounter, such as managing data structures, sorting, searching, hashing, networking, and other important program functions.
In plain English, and with the help of sample code and numerous working examples, programming guru Rod Stephens brings you up to speed on algorithm fundamentals, and, with the help of ready–to–run programs that you can use to try out the algorithms, he shows you how to:
∗ Compare the strengths and weaknesses of different algorithms to select the best one for a particular situation
∗ Analyze algorithms both theoretically and in real–world situations
∗ Anticipate performance problems before they become disasters
∗ Customize algorithms to suit your particular needs
∗ Effectively use both classical algorithms and the latest object–oriented techniques
∗ Identify performance bottlenecks where changes can have the greatest impact on speed
The CD–ROM supplies you with:
∗ Delphi source code for all the algorithms described in the book
∗ Test programs to try them out
∗ A library of important algorithms you can use immediately without wasting valuable programming time
Visit the author′s comprehensive Delphi site at :www.delphi–helper.com
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organise and find favourite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Reviews
Most Helpful Customer Reviews
1 of 1 people found the following review helpful
Format:Paperback
Lets face it Algorithms aren't the most exciting subject in the world! This book provides a good introduction to data structures (linked lists, binary trees) and sort/search methods. It also goes into some quite complex methods so is good for beginners and advanced programers. I would recommend the book for those who wish to improve the speed and efficiency of the way their programs store,sort and search data. Don't expect the book to teach you how to program Delphi or provide a reference to Delphi Commands it is purely about adding efficient data structures to your programs. The programs included on the CD are simple but illustrate the points in the book well and are great for adding straight into your own code. Don't worry about the book having Delphi 3.0 in the title as the concepts work on any version of Delphi and could even be converted to another programming language without too much trouble. All in all; well worth it if you want to know more about Delphi Algorithms and not so worth it if you don't!
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
6 reviews
12 of 12 people found the following review helpful
Nice try but sloppily tech edited
15 Jan 1999
Format:Paperback
I really wanted to like this book mainly because there has been nothing like it for Delphi. The algorithms hare handled competently enough and the breadth is all one could ask for in an introductory book. The code however is pretty bad. It shows that Mr Stephens converted it from Visual Basic and that he doesn't have enough Delphi knowledge (eg using / instead of div, integers are NOT 2 bytes). It isn't Ready-To-Run by any stretch of the imagination. There are some annoying lapses in the text as well (a nice chapter on hash tables but nothing about hash functions?). As far as I can tell no tech editing was done and it shows. Nice try.
10 of 10 people found the following review helpful
A very deceiving book
7 Sep 2001
Format:Paperback
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.
7 of 7 people found the following review helpful
A great book for everyone who appreciates CS
4 Feb 1999
Format:Paperback
This book has an excellent collection of classic and modern computer science algorithms. Unlike many other similar books, Rod Stephens (the author) goes deep into every topic. For example, under "searching" most books write about why do we need searching, describe exhaustive searching, and then finish with binary search, saying "look: we can search among 16 items with only 4 comparisons, - is that cool or what?!" On the other hand, here is what "Ready to Run Delphi 3.0 algorithms" has under "searching": exhaustive search, searching sorted lists, searching linked lists, binary search, interpolation search, string data, hunting and searching, binary hunt and search, interpolative hunt and search. The chapters are Fundamental Concepts, Lists, Stacks and Queues, Arrays, Recursion, Trees, Balanced Trees, Decision Trees, Sorting, Searching, Hashing, Network Algorithms, and OO Techniques. I gave 4 out of 5 rating because although there is a lot of stuff in there, some important algorithms are missing. Minimax discussion is not followed by alpha-beta pruning. Heuristics, probably the most interesting part of decision trees (at least to me) is barely touched and no sample code is given. To summarize, this book' material is what I went to university for.
Were these reviews helpful?
Let us know
Listmania!
Look for similar items by category
- Books > Computing & Internet > Databases > Database Theory
- Books > Computing & Internet > Hardware
- Books > Computing & Internet > Programming > Algorithms
- Books > Computing & Internet > Programming > Languages > Delphi
- Books > Computing & Internet > Programming > Languages > Visual Basic
- Books > Computing & Internet > Software & Graphics
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
