//***********************************************
// Insert into array assending, Highest element falls off
// Preclear to Lowest value
// 8,9,10,11,12,...
//***********************************************
/*
void insertionSortAscending(INT8U value, INT8U *array, INT8U size)
{
	INT8U i, j;

	i = 0;
	do
	{
		if(value < array[i])			// find proper place
		{
			for(j=size-1; j>i; j--)	// Move other elements up to make a space
			{
				array[j] = array[j-1];
			}
			array[i] = value;			//and save save new element
			break;						// done
		}
		i++;
	}
	while(i < size);
}
*/
//***********************************************
// Insert into array Descending, lowest element falls off
// Preclear to Lowest value
// 12,11,10,9,8,...
//***********************************************
void insertionSortDescending(INT8U value, INT8U *array, INT8U size)
{
	INT8U i, j;

	i = 0;
	do
	{
		if(value > array[i])			// find proper place
		{
			for(j=size-1; j>i; j--)	// Move other elements up to make a space
			{
				array[j] = array[j-1];
			}
			array[i] = value;			//and save save new element
			break;						// done
		}
		i++;
	}
	while(i < size);
}