Cod sursa(job #2638303)
| Utilizator | Data | 27 iulie 2020 18:51:54 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.77 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,v[500001],p=1,m;
void quicks (int v[],int st,int dr)
{
if (st<dr)
{
int m=(st+dr)/2,aux=v[st];
v[m]=aux;
int i=st,j=dr,d=0;
while (i<j)
{
if (v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
d=1-d;
}
i+=d;
j-=1-d;
}
quicks(v,st,i-1);
quicks(v,i+1,dr);
}
}
int main()
{
f>>n;
for (int i=1; i<=n; i++)
{
f>>v[i];
}
quicks(v,1,n);
for (int i=1; i<=n; i++)
{
g<<v[i]<<' ';
}
return 0;
}
