Cod sursa(job #3131441)
| Utilizator | Data | 20 mai 2023 10:27:36 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[500001],aux,j;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int 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(int i=1;i<=n;i++)
fout<<v[i]<<" ";
return 0;
}
