Cod sursa(job #1615437)
| Utilizator | Data | 26 februarie 2016 16:13:14 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,v[500001],ok;
void citire(){
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
}
void afisare(){
for(int i=1;i<=n;i++)
g<<v[i]<<" ";
}
void sortare(){
do{
ok=1;
for(int i=1;i<n;i++)
if(v[i]<v[i+1]){
swap(v[i],v[i+1]);}
}while(ok==0);
}
int main()
{
citire();
sortare();
afisare();
return 0;
}
