Cod sursa(job #1448105)
Utilizator | Data | 6 iunie 2015 11:36:22 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ ifstream f("algsort.in");
ofstream g("algsort.out");
int *v,n,i,j,aux;
f>>n;
v=new int[n];
for(i=0;i<n;i++)
f>>v[i];
for(i=1;i<n;i++)
{
aux=v[i];
for(j=i-1;j>=0 && v[j]>aux;j--)
v[j+1]=v[j];
v[j+1]=aux;}
for(i=0;i<n;i++)
g<<v[i]<<" ";
return 0;
}