Cod sursa(job #2626698)
Utilizator | Data | 7 iunie 2020 18:31:04 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<bits/stdc++.h>
using namespace std;
int n, a[500001];
int main() {
ifstream cin("algsort.in");
ofstream cout("algsort.out");
cin>>n;
for (int i=0; i<n; i++) cin>>a[i];
for (int i=1; i<n; i++) {
int x = a[i], j = i-1;
while (j>=0 && a[j]>x) a[j+1]=a[j], j--;
a[j+1]=x;
}
for (int i=0; i<n; i++) cout<<a[i]<<" ";
return 0;
}