Cod sursa(job #2220223)
| Utilizator | Data | 10 iulie 2018 22:52:23 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
void bSort(long v[10000000],long n)
{
long temp,i,j;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(v[i]>v[j])
{
temp=v[i];
v[i]=v[j];
v[j]=temp;}
}
int main()
{
long n,v[100000],i;
f>>n;
for(i=0;i<n;i++)
f>>v[i];
bSort(v,n);
for(i=0;i<n;i++)
g<<v[i]<<" ";
return 0;
}
