Cod sursa(job #612458)
Utilizator | Data | 7 septembrie 2011 18:36:51 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
using namespace std;
void sort(int& a, int& b)
{int aux; aux=a;a=b; b=aux;}
int main()
{int gasit,i,n,v[500000];
ifstream f("date.in");
ofstream t("date.out");
f>>n;
for(i=0;i<n;i++){f>>v[i]; cout<<v[i]<<" ";} cout<<"\n";
do{ gasit=0;
for(i=0;i<n-1;i++)
if(v[i]>v[i+1]){sort(v[i],v[i+1]); gasit=1;}
}while(gasit==1);
for(i=0;i<n;i++)t<<v[i]<<" ";
return 0;
}