Cod sursa(job #1153078)
Utilizator | Baltaretu Andrei BaltaretuAndrei | Data | 25 martie 2014 11:13:14 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int i,n,a[500000];
void swp(int &i,int &j)
{
int t;
t=i;
i=j;
j=t;
}
int part(int st,int dr)
{
int i,j,p;
j=st-1;
p=a[dr];
for(i=st;i<=dr;i++)
if(a[i]<=p)
swp(a[++j],a[i]);
return j;
}
int qwk(int st,int dr)
{
int poz;
poz=part(st,dr);
if(st<poz-1)
poz=qwk(st,poz);
if(dr>poz+1)
poz=qwk(poz+1,dr);
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
qwk(1,n);
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
}