Pagini recente » Cod sursa (job #3122576) | Cod sursa (job #2427812) | Cod sursa (job #1576313) | Istoria paginii preoji/clasament/11-12 | Cod sursa (job #1125541)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n;
vector<int> v;
void citire()
{
for(int i=0;i<n;++i)
{
int a;
fin>>a;
v.push_back(a);
}
}
void afisare()
{
for(int i=0; i<n; ++i)
{
fout<<v[i]<<" ";
}
fout<<"\n";
}
void sortare()
{
int schimbat;
do
{
schimbat=0;
for(int i=0; i<n-1; ++i)
if(v[i]>v[i+1])
{
v[i]+=v[i+1];
v[i+1]=v[i]-v[i+1];
v[i]=v[i]-v[i+1];
schimbat=1;
}
}while(schimbat);
}
int main()
{
fin>>n;
citire();
sortare();
afisare();
// for(int i=0;i<v.size();++i)
// cout<<v[i]<<" ";
return 0;
}