Cod sursa(job #1344190)
Utilizator | Data | 16 februarie 2015 15:09:42 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main()
{
int n,i,x=0,j,v[500000];
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<n; i++)
for(j=i+1; j<=n; j++)
if(v[i]>v[j])
{
x=v[i];
v[i]=v[j];
v[j]=x;
}
for(i=1;i<=n;i++)
g<<v[i]<<" ";
return 0;
}