// Insert sort
// Date 22:32 12/10/2016
// By Ben a.k.a DreamVB

#include <iostream>

using namespace std;
using std::cout;
using std::endl;

void PrintArray(int size, int*nums){
	int i = 0;
	while (i < size){
		if (nums[i] != 0){
			cout << nums[i] << " ";
		}
		i++;
	}
}

int main(int argc, char *argv[]){
	const int size = 16;
	int nums[size] = { 8, 6, 10, 12, 3, 9,150,88,256,41,99 };

	int i = 0;
	int j = 0;
	int t = 0;

	//Print out items
	cout << "Unsorted : ";
	PrintArray(size, nums);

	//Sort array
	for (i = 1; i < size - 1; i++){
		j = i;
		while (j > 0 && nums[j - 1] > nums[j]){
			t = nums[j];
			nums[j] = nums[j - 1];
			nums[j - 1] = t;
			j--;
		}
	}

	//Sorted
	cout << endl;
	cout << "Sorted : ";
	PrintArray(size, nums);

	cout << endl;

	system("pause");
	return 0;
}