Cod sursa(job #1153670)
| Utilizator | Data | 25 martie 2014 17:21:36 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main()
{
int i,j,n,v[500000],x;
f>>n;
for(i=0;i<n;i++)
f>>v[i];
for(i=0;i<n-1;i++)
{
x=i;
for(j=i+1;j<n;j++)
if(v[j]<x)
x=j;
if(x!=i)
{
v[i]=v[i]+v[x];
v[x]=v[i]-v[x];
v[i]=v[i]-v[x];
}
}
for(i=0;i<n;i++)
g<<v[i]<<" ";
return 0;
}
