#include <stdio.h>

void quicksort(int *pole,int left,int right)
{
  int i=left,
      j=right,
      v=pole[(left+right)/2],
      t;

  do {
    while(pole[i]<v)
      i++;
    while(v<pole[j])
      j--;
    if(i<=j)
    { t=pole[i];
      pole[i]=pole[j];
      pole[j]=t;
      i++; j--;
    }
  } while(i<=j);
  if(left<j)
    quicksort(pole,left,j);
  if(i<right)
    quicksort(pole,i,right);
}

void main(void)
{ int *hodnoty,pocet,i;

  clrscr();
  printf("Zadej velikost pole hodnot: ");
  scanf(" %d",&pocet);

  hodnoty=(int *)malloc(pocet*sizeof(int));

  for(i=0;i<pocet;i++)
  { printf("%d. cislo = ",i+1);
    scanf(" %d",&hodnoty[i]);
  }

  quicksort(hodnoty,0,pocet-1);

  for(i=0;i<pocet;i++)
    printf("%d  ",hodnoty[i]);
}