Cod sursa(job #721368)
| Utilizator | Data | 23 martie 2012 17:36:46 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int a[100],n,i,t,j;
fstream f("algsort.in",ios::in);
fstream g("algsort.out",ios::out);
f>>n;
f>>a[0];
for(i=1;i<n;i++)
{
f>>t;
j=i-1;
while(j>=0&&a[j]>t)
{
a[j+1]=a[j];
j--;
}
a[j+1]=t;
}
for(i=0;i<n;i++)
g<<a[i]<<" ";
f.close();
g.close();
return 0;
}
