struct Cell
{
	int data;
	int occur;
};

void insertionSort(struct Cell* space)
{
	int i, j, temp_data, temp_occur;
	
	for(i = 2; i < SIZE; i++)
	{
		temp_data = space[i].data;
		temp_occur = space[i].occur;
	
		for(j = i - 1; j >= 0 && space[j].data > temp_data; j--)
		{
			space[j+1].data = space[j].data;
			space[j+1].occur = space[j].occur;
		}
		space[j+1].data = temp_data;
		space[j+1].occur = temp_occur;       
	}
	
	return;
}