BUBBLE SORT SUBROUTINE
void bubble_sort(int numbers[], int size)
   {
   int i, j;
   int temp;
   bool swapped = true;

   for (i = (size - 1); i >= 0 && swapped; i--)
      {
      swapped = false;

      for (j = 1; j <= i; j++)
         {
         if (numbers[j-1] > numbers[j])
            {
            temp = numbers[j-1];
            numbers[j-1] = numbers[j];
            numbers[j] = temp;
            swapped = true;
            }
         }
      }
   }

INSERTION SORT SUBROUTINE
void insertion_sort(int numbers[], int size)
   {
   int i, j;
   int bucket;

   for (i = 1; i < size; i++)
      {
      bucket = numbers[i];

      for (j = i; (j > 0) && (numbers[j-1] > bucket); j--)
         numbers[j] = numbers[j-1];

      numbers[j] = bucket;
      }
   }

SELECTION SORT SUBROUTINE
void selection_sort(int numbers[], int size)
   {
   int i, j, min;
   int temp;

   for (i = 0; i < (size - 1); i++)
      {
      min = i;

      for (j = i+1; j < size; j++)
         {
         if (numbers[j] < numbers[min])
            min = j;
         }

      temp = numbers[min];
      numbers[min] = numbers[i];
      numbers[i] = temp;
      }
   }