Cod sursa(job #798210)
| Utilizator | Data | 15 octombrie 2012 22:12:48 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int a[600000],n;
void citire ()
{
ifstream fin("algsort.in");
fin>>n;
for(int i=0;i<n;i++)
fin>>a[i];
}
void sortare ()
{
int ok=0;
int p=n;
do{
ok=0;
p--;
for(int i=0;i<p;i++)
if(a[i]>a[i+1]){
int aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=1;
}
}while(ok!=0);
}
void afisare()
{
ofstream fout("algsort.out");
for(int i=0;i<n;i++)
fout<<a[i];
}
int main()
{
citire();
sortare();
afisare();
return 1;
}