Cod sursa(job #1651130)
Utilizator | Data | 12 martie 2016 12:41:26 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream in ("algsort.in");
ofstream out ("algsort.out");
int main()
{
int n, v[500000], i, j, aux;
in>>n;
for (i=1; i<=n; i++) in>>v[i];
for (i=1; i<n; i++)
for (j=i+1; j<=n; j++)
if (v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
for (i=1; i<=n; i++) out<<v[i]<<" ";
return 0;
}