Pagini recente » Cod sursa (job #1973565) | Cod sursa (job #1973599) | Borderou de evaluare (job #1293669) | Cod sursa (job #2082846) | Cod sursa (job #1025230)
#include<fstream>
using namespace std;
ifstream f("algsort.in", ios::in);
ofstream g("algsort.out", ios::out);
void poz( int li, int ls, int &k, int a[5000000])
{
int i=li, j=ls, c, i1=0, j1=-1;
while(i<j)
{
if(a[i]>a[j])
{
c=a[j];
a[j]=a[i];
a[i]=c;
c=i1;
i1=-j1;
j1=-c;}
i=i+i1;
j=j+j1;}
k=i;}
void quick(int li, int ls)
{
int k,a[5000000];
if(li<ls)
{poz(li,ls,k,a);
quick(li,k-1);
quick(k+1, ls);}}
int main()
{
int n,a[5000000],i,j,aux;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
quick(1,n);
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;}