// selsort.cpp

#include <iostream>

using namespace std;


int main() {

	int data[] = {10,8,1,14,18,4,1,3};

	int size = 8;

	int *d2 = new int[8];
	d2[0] = 10;


	int i=0;
	for(i=0;i<size;i++) {
		cout << data[i] << ",";
	}
	cout << endl;


	// selection sort
	int pass;
	for(pass=0;pass<size-1;pass++) {

		// find smallest
		// guess it is at pass
		int small_loc = pass;
		int j;
		for(j=pass+1;j<size;j++) {
			// compare
			if (data[j]<data[small_loc]){
				small_loc = j;
			}
		}

		// swap into correct location
		int temp = data[pass];
		data[pass] = data[small_loc];
		data[small_loc] = temp;

	}

	for(i=0;i<size;i++) {
		cout << data[i] << ",";
	}
	cout << endl;

	return 0;
}