void selsort(int x[ ],int n)
/* purpose: to sort a numerical vector in ascending order using
            the selection sort algorithm 
parameters: x -- the array to be sorted/input&output
            n -- the number of elements in the array */
{ int min; /*position of minimum*/
  int i,j; /*counters for loops */
  float t; /*temporary hold for interchange*/
  char deck[5][20];
/*outer loop to find min of what is left */
  for(i=0;i<n-1;i++)
{ min = i; /*assume smallest in current position*/
  for(j=i+1;j<n;j++) /*look thru rest*/
  {
  if(x[j]<x[min])  /*see if less than current min */
    min = j;  /*yes, so note its position */
  }
    t = x[i]; /*found min so move it into position */
    x[i]=x[min];
    x[min] = t;
    swap(deck,i,j);
    } /*end of outer loop*/
 } /*end of function */

void swap(char terms[][20],int i,int j)
{
     char temp[20];
     strcpy(temp,terms[i]);
     strcpy(terms[i], terms[j]);
     strcpy( terms[j],temp);
}

    swap(deck,i,j);

    swap(deck,i,min);