void selection_sort (int items[], int n)
{

   int min_sub;

   for (int fill = 0; fill < n-1; fill++)
   {
      min_sub = find_min(items, fill, n-1);

      if (fill != min_sub)
        exchange(items[fill], itmes[min_sub]);
   }
}  // end selection_sort


int find_min(int items[], int fill, int last)
{
   int min_index = fill;

   for (int i = fill; i <= last; i++)
     if (items[i] <= items[min_index])
         min_index = i;

   return min_index;
} // find_min