Pagini recente » Cod sursa (job #2086845) | Cod sursa (job #549769) | Cod sursa (job #2541743) | Cod sursa (job #325935) | Cod sursa (job #556082)
Cod sursa(job #556082)
#include<iostream.h>
#include<fstream.h>
long long a[500001],N;
int ok;
void sort()
{
int aux;
do
{
ok=0; int i=1;
while(i<N)
{ if(a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=1;
}
i++; }
}while(ok!=0);
}
int main()
{
ifstream f;
f.open("algsort.in");
f>>N;
ofstream g;
g.open("algsort.out");
for(int i=1;i<=N;i++)
f>>a[i];
sort();
for(int i=1;i<=N;i++)
g<<a[i]<<" ";
f.close();
g.close();
}