Cod sursa(job #1359958)
Utilizator | Data | 25 februarie 2015 10:18:02 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f ("algsort.in");
ofstream g ("algsort.out");
int v[500000],n,i,j,aux;
int v[500000],n,i,j,aux;
int main()
{
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]) {aux=v[i];v[i]=v[j];v[j]=aux; }
for(i=1;i<=n;i++)
g<<v[i]<<' ';
return 0;
}