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.