InsertionSort< T > Class Template Reference

A InsertionSort implementation for sorting arrays. More...

#include <insertionsort.h>

Inheritance diagram for InsertionSort< T >:

List of all members.

Public Member Functions
int	Sort (T *_array, size_t _size)
	Sorts an array using the InsertionSort method.

---

Detailed Description

template<class T>
class CrissCross::Data::InsertionSort< T >

A InsertionSort implementation for sorting arrays.

Deprecated:

This is an extremely slow sorting method. It is provided for educational purposes ONLY.

---

Member Function Documentation

int Sort	(	T *	_array,
		size_t	_size
	)			[inline, virtual]

Sorts an array using the InsertionSort method.

Parameters:

	_array	The array to sort.
	_size	The size of the array to sort.

Returns:

0 on success.

See also:

HeapSort ShellSort CombSort

Implements Sorter< T >.

References CrissCross::Data::Compare().