Pagini recente » Cod sursa (job #1693730) | Cod sursa (job #2302267) | Cod sursa (job #2396382) | Cod sursa (job #3271773) | Cod sursa (job #2100497)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[11];
int main()
{
fin>>n;
for(int i =1 ; i <=n ; i++)
fin>>v[i];
int ok,aux;
do
{
ok=1;
for(int i= 1; i < n ; i++)
if(v[i] > v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=0;
}
}while(ok!=1);
for(int i =1 ; i <= n ; i++)
fout<<v[i];
return 0;
}