Pagini recente » Cod sursa (job #3274411) | Cod sursa (job #2407373) | Cod sursa (job #1770510) | Cod sursa (job #2446383) | Cod sursa (job #612455)
Cod sursa(job #612455)
#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,v[5000],n;
ifstream f("algsort.in");
ofstream t("algsort.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;
}