Pagini recente » Cod sursa (job #1084244) | Cod sursa (job #1324134) | Cod sursa (job #1343073) | Cod sursa (job #409644) | Cod sursa (job #3125400)
#include <fstream>
using namespace std;
ifstream cin ("algsort.in");
ofstream cout ("algsort.out");
int v[500001];
int n, i, j, maxx;
int main ()
{
cin >> n;
for (i=1; i<=n; i++)
cin>>v[i];
for (i=n; i>=2; i--)
{
maxx = v[1];
p = 1;
for (j=2; j<=i; j++)
if (v[j] > maxx)
{
maxx = v[j];
p = j;
}
swap(v[i], v[p]);
}
for (i=1; i<=n; i++)
cout<<v[i]<<" ";
return 0;
}