Cod sursa(job #535113)
| Utilizator | Data | 16 februarie 2011 19:49:20 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
int main (void)
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,v[100],test,aux;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
do
{
test=1;
for(i=1;i<=n-1;i++)
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
test=0;
}
}while(test==0);
for(i=1;i<=n;i++)
g<<" "<<v[i];
f.close ();
g.close ();
}
