Cod sursa(job #3253908)
| Utilizator | Data | 5 noiembrie 2024 11:59:35 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[500001],aux[500001];
void quicksort(int st, int dr){
if(st>=dr)
return;
nth_element(v+st, v+(st+dr)/2, v+dr+1);
quicksort(st, (st+dr)/2-1);
quicksort((st+dr)/2+1, dr);
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
quicksort(1,n);
for(int i=1;i<=n;i++)
fout<<v[i]<<' ';
return 0;
}
