Cod sursa(job #1677945)
| Utilizator | Data | 6 aprilie 2016 21:27:03 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
void bt(int x)
{
}
int main()
{
int n,i,j;
vector <int> v;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;++i)
{
f>>j;
v.push_back(j);
}
for(i=0;i<n;++i)
for(j=i;j<n;++j)
if(v[j]<v[i])
swap(v[j],v[i]);
for(i=0;i<n;++i)
g<<v[i]<<" ";
f.close();
g.close();
return 0;
}
