Insertion Sort Source Code
(Up to Resources : Source Code Repository : Sorts)

This source file is an implementation of the Insertion Sort algorithm. The sort is implemented with templates. For the templated class, the elements must have the operators >, =, and < defined.

The sort itself is implemented as a class constructor. Basically, the function call is in the following format:

InsertionSort<TYPE>(Array, Num);

TYPE is the data type of the elements, Array is the actual array to be sorted, and Num is the number of elements that are to be sorted. The array is sorted in place, so there is no actual return value for the function.

Download the Source: insertion.h