Cod sursa(job #3031010)
| Utilizator | Data | 18 martie 2023 11:35:13 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
void interchange(vector<int> &v,int n)
{
for(int i=0;i<n-1;i++)
for(int j=i+1;j<n;j++)
if(v[i]>v[j])
{
swap(v[i],v[j]);
}
}
int main()
{
vector<int> v;
int i,j,x,n;
while(in>>x)
{
v.push_back(x);
}
interchange(v,v.size());
for(i=0;i<v.size();i++)
out<<v[i]<<" ";
return 0;
}
