#include <iostream>
using namespace std;

int a[50],n,i;

void quickSort(int a[], int p, int u) {

   int i = p, j = u;

   int m;

   int mijloc = a[(p + u) / 2];

   while (i <= j) {  

while (a[i] < mijloc)

   i++;  

while (a[j] > mijloc)

   j--;  

  if (i <= j)

  {

m=a[i];

a[i] =a[j];

a[j] = m;

   i++;  

   j--;  

  }  

  } 

  if (p < j)

quickSort(a, p, j);

  if (i < u)

quickSort(a, i, u);

  }  

int main()

{

 int n,i;

 

 cout<<endl<<endl;

 cout<<"n=";

 cin>>n;

 for(i=1;i<=n;i++)

 {

  cout<<"a["<<i<<"]=";cin>>a[i] ;

 }

 quickSort(a,1,n);

 cout<<endl;

 cout<<"Sirul sortat"<<endl;

 for(i=1;i<=n;i++)

cout<<a[i]<<" ";

}