Pagini recente » Cod sursa (job #1905701) | Cod sursa (job #2525862) | Cod sursa (job #3228510) | Cod sursa (job #2164875) | Cod sursa (job #1117588)
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
long int n,i,gasit,aux;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
unsigned long long int v[n+2];
for(i=1;i<=n;i++)
{
f>>v[i];
}
do
{
gasit=0;
for(i=1;i<=n;i++)
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
gasit=1;
}
}
while(gasit==1);
for(i=1;i<=n;i++)
{
g<<v[i]<<" ";
}
return 0;
}