The Tomes of Delphi: Algorithms and Data Structures
Paperback, 524 pages
| Price: | $28.57 |
|---|
Ships in 3–5 business days
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.
Ratings & Reviews
Log In to review this item
Review The Tomes of Delphi: Algorithms and Data Structures
Lulu Sales Rank: 615
7 People Reviewed This Item
Excellent book.
It's a very well written book with a hard to find proportion of theory and practice. Although Delphi-oriented, I think it's usefull for any programmer.
Thanks to the author for making it available again.
The book helped me find what I needed to get over the mental obstacles I had about algorithms. It was a big help in my term paper.
In the
coach outlet online http://www.coachoutletonlinelove.com
shop, a collection of high quality and hottest Coach Shoulder Bags is offered to you. They are all at the best prices you will ever find.With the safe door to door shipping, the
coach outlet http://www.coachoutletonlinelove.com
will send the products to your hands, which are of top quality and at competitive factory prices.
louis vuitton uk http://www.louisvuitton-ukoutlet.org.uk
The book starts off with the basic ground work surrounding algorithms: what is a proof? Computer Science, Mathematics and theory, etc.. It basically answers the question why anyone should bother learning about algorithms and the complexity that surrounds this topic. The authors then take a rather unique approach to the theory behind algorithms by discussing program recursion and iteration. It seems a little odd, but it turns out to be a very good way to introduce readers to topic algorithms. Recursions is a topic covered in CS1 courses, and using that as the basis and introduction to algorithm design and correctness proof really reels in the reader and makes the topic easier to grasp.
Corllins University
Corllins University
"Excellent Algorithms book.. A must for delphi developers"
If your a delphi developer and don't own this book.
You should..
It covers a variety of classic algorithms in delphi.
Well worth the money..
You should..
It covers a variety of classic algorithms in delphi.
Well worth the money..
You Recently Viewed
![[Loading...]](http://static.lulu.com/images/ajax-loader.gif?20120131141155)
