Cod sursa(job #3125157)
Utilizator | Data | 2 mai 2023 09:57:50 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[500005],n,aux;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
for(int i=2; i<=n; i++)
{
aux=v[i];
int j=i-1;
while(j>=1 && v[j]>aux)
{
v[j+1]=v[j];
j--;
}
v[j+1]=aux;
}
for(int i=1; i<=n; i++)
g<<v[i]<<' ';
return 0;
}