Cod sursa(job #668961)
| Utilizator | Data | 25 ianuarie 2012 21:30:58 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
using namespace std;
#include<fstream>
int main()
{
long long N,v[500001],i,j,gata;
ifstream fcin("algsort.in");
ofstream fcout("algsort.out");
fcin>>N;
for(i=1;i<=N;i++)
fcin>>v[i];
do{
for(j=1;j<=N-1;j++)
for(gata=1,i=1;i<=N-1;i++)
if (v[i]>v[i+1])
{ v[i]+=v[i+1];
v[i+1]=v[i]-v[i+1];
v[i]=v[i]-v[i+1];
gata=0;
}
}while(gata==0);
for(i=1;i<=N;i++)
fcout<<v[i]<<" ";
fcin.close();
fcout.close();
return 0;
}
