|
Free ebooks
 Free programing ebooks Delphi The Tomes of Delphi Algorithms and Data Structures - Wordware Publishing
|
||||||||
 Chapter 1 lays out some ground rules. It starts off by discussing performance. We’ll look at measurement of the efficiency of algorithms, starting out with the big-Oh notation, continuing with timing of the actual run time of algorithms, and finishing with the use of profilers. Chapter 2 covers arrays. We’ll look at the standard language support for arrays, including dynamic arrays; we’ll discuss the TList class; and we’ll create a class that encapsulates an array of records. Another specialized array is the string, so we’ll take a look at that too. Chapter 3 introduces linked lists, both the singly and doubly linked varieties. We’ll see how to create stacks and queues by implementing them with both singly linked lists and arrays. Chapter 4 talks about searching algorithms, especially the sequential and the binary search algorithms. We’ll see how binary search helps us to insert items into a sorted array or linked list. Chapter 5 covers sorting algorithms. We will look at various types of sorting methods: bubble, shaker, selection, insertion, Shell sort, quicksort, and merge sort. Chapter 6 discusses algorithms that create or require random numbers. We’ll see pseudorandom number generators (PRNGs) and show a remarkable sorted data structure called a skip list, which uses a PRNG in order to help balance the structure. Chapter 7 considers hashing and hash tables, why they’re used, and what benefits and drawbacks they have. Several standard hashing algorithms are introduced. Chapter 8 presents binary trees, a very important data structure in wide general use. We’ll look at how to build and maintain a binary tree and how to traverse the nodes in the tree. Chapter 9 deals with priority queues and, in doing so, shows us the heap structure. We’ll consider the important heap operations, bubble up and trickle down, and look at how the heap structure gives us a sort algorithm for free: the heapsort. Chapter 10 provides information about state machines and how they can be used to solve a certain class of problems. Chapter 11 squeezes in some data compression techniques. Algorithms such as Shannon-Fano, Huffman, Splay, and LZ77 will be shown. Chapter 12 includes a variety of advanced topics that may whet your appetite for researching algorithms and structures. Of course, they still will be useful to your programming requirements. Download free ebook of Delphi: The Tomes of Delphi Algorithms and Data Structures
|
| More free ebooks | |