Cod sursa(job #1501231)
Utilizator | Data | 13 octombrie 2015 08:25:17 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int n,v[500000],sortat,t;
void sortat1()
{
do
{
sortat = 1;
for(int i=1;i<n;i++)
{
if(v[i]>v[i+1])
t=v[i],v[i]=v[i+1],v[i+1]=t,sortat=0;
}
}while(sortat==0);
}
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
sortat1();
for(int i=1;i<=n;i++)
out<<v[i]<<" ";
return 0;
}