Cod sursa(job #583790)
| Utilizator | Data | 22 aprilie 2011 17:35:08 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int main()
{
int v[500008],n,i;
ifstream g("algsort.in");
ofstream z("algsort.out");
g>>n;
for(i=1;i<=n;i++)
g>>v[i];
int k=0;
bool ok=false;
do
{
ok=false;
for(i=1;i<n-k;i++)
{
if(v[i]>=v[i+1])
swap(v[i],v[i+1]);
ok=true;
}
k++;
}while(ok==true);
for(i=1;i<=n;i++)
z<<v[i]<<" ";
return 0;
}
