Sorting and Searching Algorithms: A Cookbook
Author(s) : Thomas Niemann, Portland, Oregon
Publication Date : n/a
Terms and Conditions:
| Thomas Niemann wrote: |
| Permission to reproduce this document, in whole or in part, is given provided the original web site listed below is referenced, and no additional restrictions apply. Source code, when part of a software project, may be used freely without reference to the author. |
This is a collection of algorithms for sorting and searching. Descriptions are brief and intuitive, with just enough theory thrown in.
The first section introduces basic data structures (array and linked list) and timing notation. Readers will be shown the strength and weakness of each choice of data structures.
The next section presents several sorting algorithms. This is followed by techniques for implementing dictionaries, structures that allow efficient search, insert, and delete operations. There exists some algorithms that do all the three operations efficiently.
The last section illustrates algorithms that sort data and implement dictionaries for very large files.
Intended Audience
This cookbook assumes that the reader knows C and familiar with concepts such as arrays and pointers. Source code for each algorithm, in ANSI C, is included.
View/Download Sorting and Searching Algorithms: A Cookbook |
ANSI C source code
