Pagini recente » Cod sursa (job #1774070) | Cod sursa (job #2872289) | Cod sursa (job #1659678) | Cod sursa (job #146684) | Cod sursa (job #1182406)
#include <fstream>
using namespace std;
const int nmax=500000;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int a[nmax] , n;
void sort(int left,int right)
{
int i=left, j=right,m;
m=a[(i+j)/2];
while (i<=j)
{
while(a[i]<m) i++;
while (a[j]>m) j--;
if (i<=j)
{
swap(a[i],a[j]);
i++;
j--;
}
}
if (i<right) sort(i,right);
if (left<j) sort(left,j);
}
int main()
{
cin>>n;
int i;
for (i=1;i<=n;i++) cin>>a[i];
sort(1,n);
for (i=1;i<=n;i++) cout<<a[i]<<" ";
}