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