Pagini recente » Cod sursa (job #3259277) | Cod sursa (job #1107523) | Cod sursa (job #2520481) | Cod sursa (job #1445641) | Cod sursa (job #1305782)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int v[100],n,i,t,p,m,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
m=n;
for(k=1;k<n;k++)
{
for(t=1;t<m;t++)
if(v[t]>v[t+1])
{
p=v[t+1];
v[t+1]=v[t];
v[t]=p;
}
m=m-1;
}
for(i=1;i<=n;i++)
fout<<v[i]<<' ';
fin.close();
fout.close();
return 0;
}