INSERTION SORT FUNCTION
*/

//EXCHANGE FUNCTION
void exchange(char &x, char &y)
{
  char temp; 	//CREATE TEMPORARY VARIABLE
  temp = x;	//SET temp TO x
  x = y;	//SET x TO y
  y = temp;	//SET y TO temp
} //END exchange()

 //INSERTION SORT FUNCTION
void insertSort(char array[SIZE])
{
  int i;	//OUTER LOOP CONTROL VARIABLE
  int j;   	//INNER LOOP CONTROL VARIABLE
  i = 1;	//SET i TO SECOND ARRAY INDEX
  while (i < SIZE)	//MAKE SIZE - 1 PASSES THRU ARRAY
  {
     j = i;	//j LOCATES FIRST ELEMENT 
						//OF UNSORTED ARRAY
     while ((j > 0) && (array[j] < array[j - 1]))  //COMPARE/EXCHANGE array[j]
																									 //AND array[j - 1]
		 {
			 exchange(array[j], array[j - 1]);
			 --j;	//MAKE j FOLLOW INSERT ELEMENT
		 } //END INNER WHILE
		 ++i;	//MAKE i LOCATE FIRST ELEMENT OF
					//UNSORTED PORTION
	 }//END OUTER WHILE
}//END insertSort()