Cod sursa(job #599612)
| Utilizator | Data | 29 iunie 2011 11:41:01 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream.h>
#include<fstream.h>
int a[500000];
void swap(int x,int y)
{int aux;
aux=a[x];
a[x]=a[y];
a[y]=aux;}
int main()
{int n,i,j,k;
ifstream f("algsort.in");
ofstream h("algsort.out");
f>>n;
f>>a[1];
for(i=2;i<=n;i++)
{f>>a[i];
k=i;
for(j=k-1;j>=1;j=j-1)
if(a[k]<a[j])
{ swap(k,j);
k=j;}
else
break;}
for(i=1;i<=n;i++)
h<<a[i]<<" ";
return 0;}