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