The Tomes of Delphi: Algorithms and Data Structures
|
Publisher: Julian Bucknall
Copyright:
© 2006 Standard Copyright License
Language: English
Country: United States
|
Printed: 524 pages, 7.44" x 9.68", perfect binding, black and white interior ink Description:Master developer Julian M Bucknall provides Delphi developers a comprehensive overview of using algorithms and data structures from a practical perspective. He begins with a discussion of algorithm performance, and provides comprehensive coverage of such topics as arrays, linked lists, and binary trees. The book focuses on search algorithms--such as sequential and binary search--and sort algorithms--including bubble, insertion, Shell, quicksort, merge sort, and heapsort--along with techniques for optimization. Additionally, the author presents hashing and hash tables; priority queues, state machines and regular expressions; and data compression techniques such as Huffman and LZ77. Keywords:Listed in: |
Stats:
This content can be found in the following groups: Delphi Developers
Customers who bought The Tomes of Delphi: Algorithms and Data Structures also bought:
Reviews:
Please log in or sign up to post a review.
You should..
It covers a variety of classic algorithms in delphi.
Well worth the money..
There are other books that cover the same material,(even the author calls it the 3rd best book on Algorithms!), but in my opinon it has two advantages over it's competitors for Delphi programmers.
1: It is written in a very accessible manner, without loss of rigour.
2: All examples are in Delphi.(Downloadable from authors website)
No other Delphi book covers this subject with anything like the same depth & clarity. If you are serious about programming in Delphi this book will pay for itself in a matter of hours. It went out of print a couple of years ago and second hand copies were changing hands for literally hundreds of dollars.
Buy, read, use, and be happy.
Julian's excellent writing style applies the correct mix of theory and application while at the same time explaining and demonstrating why you should use one algorithm over another.
If you are a serious Delphi developer, you need this book on your shelf.
[Click the preview to close]




