#include "sorting.h"

sorting::sorting(int *elems, int nbElem) {
	elements = elems;
	this->nbElem = nbElem;
}

// a simple class with two sort subprograms
void sorting::bubble_sort() {
	int i;
	int changed;
	int dummy;

	changed = 1;
	while (changed) {
		changed = 0;
		for(i=0;i<nbElem-1;++i) {
			if (elements[i] > elements[i+1]) {
				dummy = elements[i];
				elements[i] = elements[i+1];
				elements[i+1] = dummy;
				changed = 1;
			}
		}
	}
}

void sorting::selection_sort() {
	int i, j;
	int posCurMin;
	int dummy;

	for(i=0;i<nbElem;++i) {
		posCurMin = i;
		for(j=i+1;j<nbElem;++j) {
			if (elements[j] < elements[posCurMin]) {
				posCurMin = j;
			}
		}
		if (i != posCurMin) {
			dummy = elements[i];
			elements[i] = elements[posCurMin];
			elements[posCurMin] = dummy;
		}
	}
}