Sorting And Searching Algorithms by Thomas Neimann

    Don’t forget to :  Follow us on Twitter or  Facebook for updates.

Contents
Arrays
Linked Lists
Timing Estimates
Sorting
Insertion Sort
Shell Sort
Quicksort
Comparison
Dictionaries
Hash Tables
Binary Search Trees
Red-Black Trees
Skip Lists
Comparison
External Sorting
B-Trees

This is a collection of algorithms for sorting and searching. Descriptions are brief and intuitive,
with just enough theory thrown in to make you nervous. I assume you know a high-level
language, such as C, and that you are familiar with programming concepts including arrays and
pointers.
The first section introduces basic data structures and notation. The next section presents several
sorting algorithms. This is followed by a section on dictionaries, structures that allow efficient
insert, search, and delete operations. The last section describes algorithms that sort data and
implement dictionaries for very large files. Source code for each algorithm, in ANSI C, is included.
Most algorithms have also been coded in Visual Basic. If you are programming in Visual Basic, I
recommend you read Visual Basic Collections and Hash Tables, for an explanation of hashing
and node representation.

For Download: