Pagini recente » Cod sursa (job #882047) | Borderou de evaluare (job #3122119) | Cod sursa (job #2527735) | Cod sursa (job #2174718) | Cod sursa (job #2987526)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int v[5000003];
int main()
{
int n;
in>>n;
for (int i=1;i<=n;i++)
in>>v[i];
int ok;
do
{ ok=1;
for(int i=0;i<n;i++)
{
if(v[i]>v[i+1])
{swap(v[i],v[i+1]);ok=0;}
}
}while(ok==0);
for (int i=1;i<=n;i++)
out<<v[i]<<" ";
return 0;
}