Cod sursa(job #1806697)
| Utilizator | Data | 15 noiembrie 2016 17:04:49 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <ctime>
#include <cstdlib>
using namespace std;
int a[500005];
ifstream f("algsort.in");
ofstream g("algsort.out");
void Quick(int st,int dr)
{ if (st>=dr) return;
int i, p = st+(rand()%(dr-st+1)) ,ind = st-1;
swap(a[p],a[dr]);
for(i=st;i<=dr;i++)
if (a[i]<=a[dr])
{ ind++;
swap(a[ind],a[i]);
}
Quick(st,ind-1);
Quick(ind+1,dr);
}
int main()
{ int n,i;
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;
}
