Quote: This booklet contains a collection of sorting and searching algorithms.
While many books on data structures describe sorting and searching algorithms,
most assume a background in calculus and probability theory. Although a formal
presentation and proof of asymptotic behavior is important, a more intuitive
explanation is often possible.
The way each algorithm works is described in easy-to-understand terms. It
is assumed that you have the knowledge equivalent to an introductory course in C
or Pascal. In particular, you should be familiar with arrays and have a basic
understanding of pointers. The material is presented in an orderly fashion,
beginning with easy concepts and progressing to more complex ideas. Even though
this collection is intended for beginners, more advanced users may benefit from
some of the insights offered. In particular, the sections on hash tables and skip
lists should prove interesting.


Santa Cruz, California
Thomas Niemann
March, 1995