product iamge

Tomes of Delphi: Alogrithm and Data Structure

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Delphi developer Julian Bucknall provides fellow developers a comprehensive overview of using algorithms and data structures from a practical perspective. Bucknall 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 sort, 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.

The companion CD contains the author’s highly successful freeware library EZDSL, source code compatible with all versions of Delphi and with Kylix, and executables from TurboPower Software Company.

Author(s): Julian Bucknall
Series: Wordware Delphi Developer’s Library
Publisher: Wordware Publishing, Inc.
Year: 2001

Language: English
Pages: 525
Tags: Databases & Big Data;Access;Data Mining;Data Modeling & Design;Data Processing;Data Warehousing;MySQL;Oracle;Other Databases;Relational Databases;SQL;Computers & Technology;Internet, Groupware, & Telecommunications;Networking & Cloud Computing;Computers & Technology;Data Structures;Algorithms;Programming;Computers & Technology;Software Development;Software Design, Testing & Engineering;Programming;Computers & Technology;Borland Delphi;Programming Languages;Computers & Technology