#include<process.h>
#include<fstream.h>
#include<stdlib.h>


ifstream fin("algsort.in");
ofstream fout("algsort.out");


int Partition(int low,int high,int arr[]);
void Quick_sort(int low,int high,int arr[]);

int main()
{
int *a,n,low,high,i;

fin>>n;

a = new int[n];

for(i=0;i<n;i++)
fin>>a[i];
for(i=0;i<n;i++)
a[i]=rand()%100;


 for(i=0;i<n;i++)
  fout<<a[i]<<"	";
  fout<< '\n';


high=n-1;
low=0;
Quick_sort(low,high,a);

  for(i=0;i<n;i++)
  fout<<a[i]<<"	";

  fin.close();
  fout.close();
  
}



int Partition(int low,int high,int arr[])
{ int i,high_vac,low_vac,pivot/*,itr*/;
   pivot=arr[low];
   while(high>low)
{ high_vac=arr[high];

  while(pivot<high_vac)
  {
    if(high<=low) break;
    high--;
    high_vac=arr[high];
  }

  arr[low]=high_vac;
  low_vac=arr[low];
  while(pivot>low_vac)
  {
    if(high<=low) break;
    low++;
    low_vac=arr[low];
  }
  arr[high]=low_vac;
}
  arr[low]=pivot;
   return low;
}

void Quick_sort(int low,int high,int arr[])
{
  int Piv_index,i;
  if(low<high)
  {
   Piv_index=Partition(low,high,arr);
   Quick_sort(low,Piv_index-1,arr);
   Quick_sort(Piv_index+1,high,arr);
  }
}