Cod sursa(job #971810)
| Utilizator | Data | 10 iulie 2013 11:46:26 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include<fstream>
#include<iostream>
using namespace std;
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
long aux,i,n;
long vec[500005];
bool exit = true;
in>>n;
for(i = 0 ; i < n; i++ )
in>>vec[i];
do
{
exit = false;
for(i = 0 ; i < n-1 ; i++)
{
if(vec[i]>vec[i+1])
{
exit = true;
aux = vec[i];
vec[i] = vec[i+1];
vec[i+1] = aux;
}
}
}while(exit);
for(i=0;i<n;i++)
out<<vec[i]<<" ";
out.close();
in.close();
return 0;
}
