Cod sursa(job #3125708)
Utilizator | Data | 4 mai 2023 10:26:17 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int i, j, n, m, v[500002], maxim, p, 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 && v[j]>aux){
swap(v[j], v[j+1]);
j--;
}
v[j+1]=aux;
}
for(i=1;i<=n;i++)
cout<<v[i]<<" ";
}