Pagini recente » Diferente pentru problema/arbore3 intre reviziile 3 si 2 | Cod sursa (job #2602653) | Istoria paginii utilizator/2pak | Cod sursa (job #2976515) | Cod sursa (job #2236120)
#include <iostream>
#include <fstream>
#define MAX 500000
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int N,v[MAX];
void Sort(int N,int v[MAX])
{
int i,j,aux;
for(i=1;i<=N-1;i++)
for(j=i+1;j<=N;j++)
if(v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
for(i=1;i<=N;i++)
g<<v[i]<<" ";
}
int main()
{int i;
f>>N;
for(i=1;i<=N;i++)
f>>v[i];
Sort(N,v);
return 0;
}