/* Quick sort */
#include <stdio.h>
#include <math.h>

int a[20];
int qsort(int l,int r)
{
int ll,rr,aux,ii,jj,pivot;
ll=l;
rr=r;
fprintf(stdout,"%d  ",rr-ll);
if (rr-ll<2)
{ if (a[ll]>a[rr])
  {
  aux=a[ll];
  a[ll]=a[rr];
  a[rr]=aux;
  }}
 else
 {
  ii=1;jj=0;
  while(ll<rr)
   {
   if(a[ll]>a[rr])
    {
    aux=a[ll];
    a[ll]=a[rr];
    a[rr]=aux;
    aux=jj;
    jj=-ii;
    ii=-aux;
    }
    ll+=ii;
    rr+=jj;
   }
  pivot=ll;
  fprintf(stdout,"piv=%d",pivot);
  exit(1);
  qsort(l,pivot);
  qsort(pivot,r);
 }
}

int main()
{
 int n,i;
 a[1]=43;a[2]=9;a[3]=80;a[4]=21;a[5]=52;a[6]=34;a[7]=67;
 n=7;
 qsort(1,7);
 for(i=1;i<=7;i++)
  fprintf(stdout,"%d  ",a[i]);
}