Cod sursa(job #441966)
Utilizator | Data | 13 aprilie 2010 18:35:55 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int main()
{unsigned int ok,i,aux,n,v[500000];
ifstream f("algsort.in");ofstream g("algsort.out");
f>>n;
for(i=0;i<n;i++)
f>>v[i];
do
{
ok=1;
for(i=0;i<n-1;i++)
if(v[i]>v[i+1]){ok=0;aux=v[i];v[i]=v[i+1];v[i+1]=aux;}
}while (!ok);
for(i=0;i<n;i++)
g<<v[i]<<" ";
f.close();g.close();
return 0;}