Cod sursa(job #1344195)
Utilizator | Data | 16 februarie 2015 15:11:37 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream in ("algsort.in");
ofstream out ("algsort.out");
int main()
{
int v[100],i,n,gasit,aux;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
do
{
gasit=0;
for(i=1;i<=n;i++)
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
gasit=1;
}
}
while(gasit==1);
for(i=1;i<=n;i++)
out<<v[i]<<" ";
return 0;
}