Cod sursa(job #739165)
Utilizator | Data | 22 aprilie 2012 12:27:35 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
long long a[30],n,i,j,ind=1,x;
f>>n;
for(i=0;i<n;i++)
{
f>>a[i];}
for(j=n-1;j>0 && ind;j--)
{ ind=0;
for(i=0;i<j;i++)
if (a[i]>a[i+1])
{ x=a[i];
a[i]=a[i+1];
a[i+1]=x;
ind=1; }
}
for(i=0;i<n;i++)
g<<a[i]<<" ";
return 0;}