#include <stdio.h>
#include <stdlib.h>

#define MAX 100
int a[MAX];
int ap;

printData()
{  int i;
   i = 0;
   while(i<ap)
   {  printf("%d: %d\n ",i,a[i]);
      i = i+1;
   }
   printf("\n");
}

/*
void swap(int *a, int *b)
{
  int t=*a; *a=*b; *b=t;
}
void sort(int arr[], int beg, int end)
{
  if (end > beg + 1)
  {
    int piv = arr[beg], l = beg + 1, r = end;
    while (l < r)
    {
      if (arr[l] <= piv)
        l++;
      else
        swap(&arr[l], &arr[--r]);
    }
    swap(&arr[--l], &arr[beg]);
    sort(arr, beg, l);
    sort(arr, r, end);
  }
}
*/

swap(int a[],int i,int j)
{  int t;
   t = a[i];
   a[i] = a[j];
   a[j] = t;
}

int partition(int a[],int l,int r)
{  int i,j,p;
   i = l;
   j = r;
   p = a[(i+j)/2];
   while(i<=j)
   {  while(a[i]<p)
       i = i+1;
      while(a[j]>p)
       j = j-1;
      if(i<=j)
      {  swap(a,i,j);
         i = i+1;
         j = j-1;
      }
   }
   return i;
}

quicksort(int a[],int l,int r)
{  int p;
   if(l<r)
   {  p = partition(a,l,r);
      quicksort(a,l,p-1);
      quicksort(a,p,r);
   }
}
   
main(int argc,char ** argv)
{  FILE * fin;
   int i;
   int n;
   if((fin = fopen(argv[1],"r"))==NULL)
   {  printf("can't open %s\n",argv[1]);
      exit(0);
   }
   ap = 0;
   while(fscanf(fin,"%d",&n)!=EOF)
   if(ap<MAX)
   {  a[ap] = n;
      ap = ap+1;
   }
   else
   {  printf("too much data\n");
      exit(0);
   }
   printData();
   quicksort(a,0,ap-1);
   printData();
}