Cod sursa(job #1013038)
Utilizator | Data | 20 octombrie 2013 10:23:21 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,j,aux,v[50001],sortat;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
do{
sortat = 1;
for(j=1;j<n;j++)
if(v[j]>v[j+1])
{
aux=v[j];
v[j]=v[j+1];
v[j+1]=aux;
sortat = 0;
}
} while (sortat == 0);
for(i=1;i<=n;i++)
g<<v[i]<<" ";
return 0;
}