#include "sort.h"
#include <iostream>

using namespace std;

void Swap(ItemT & a, ItemT & b) {
    ItemT tmp;
    tmp = a;
    a = b;
    b = tmp;
    return;
}

void SortArray(ItemT values[], size_t size) {
     size_t start, current, smallest;

     for(start = 0; start < size-1; start++) {
        smallest = start;
	for(current = start+1; current < size; current ++) {
	   if (values[current] < values[smallest]) {
	       smallest = current;
	   }
	}

	if (smallest != start) {
	   Swap(values[smallest],values[start]);
	}
     }

     return;
}