selction_sort.cxx

// 
template <class T>
int indexOfMax(T a[], int size) { 
	int temp = 0;
   	int index = 0;   
	
	for ( int i = 0; i < size; i++ ) {
		if ( a[i] > temp ) {
			temp = a[i];
			index = i;
		}
	}
	return index;
}
//
template <class T>
void swap( T &x, T &y ) {
	T temp = a;
	a = b;
	b = temp;
} 
// the algorithm
template <class T>
void selectionSort(T a[], int n) {   
	
	for ( int size = n; size > 1; size-- ){
		int j = indexOfMax(a,size);
		swap(a[j],a[size - 1]);
	}
}