Pagini recente » Cod sursa (job #1855790) | Cod sursa (job #1167819) | Cod sursa (job #2968213) | Cod sursa (job #2753924) | Cod sursa (job #1818741)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef pair < int, int> dbl;
const int maxInt = 1e9*2;
const lli maxLong = 1e18*2;
int main(){
ifstream cin("algsort.in");
ofstream cout("algsort.out");
ios::sync_with_stdio(0);
vector <int> vct;
int n;
cin >> n;
for(int i = 0; i < n; i++){
int a;
cin >> a;
vct.push_back(a);
}
/* SELECTION
for(int i = 0; i < n; i++)
for(int j = i + 1; j < n; j++)
if(vct[i] > vct[j])
swap(vct[i], vct[j]);
*/
sort(vct.begin(), vct.end());
for(int i = 0; i < n; i++)
cout << vct[i] << ' ';
return(0);
}