Pagini recente » Diferente pentru problema/collar intre reviziile 9 si 10 | Cod sursa (job #1548566) | Cod sursa (job #1981411) | Cod sursa (job #2929742) | Cod sursa (job #1445638)
#include <fstream>
using namespace std;
int v[10001];
void qsort(int s,int d)
{
int m=v[(s+d)/2];
int i,j;
j=d;
i=s;
while(i<=j)
{
while(v[i]<m)
i++;
while(v[j]>m)
j--;
if(i<=j)
swap(v[i],v[j]);
i++;
j--;
}
if(s<j)
qsort(s,j);
if(i<d)
qsort(i,d);
}
ifstream in("algsort.in");
ofstream out("algsort.out");
int main()
{
int n,i;
in>>n;
for(i=0;i<n;i++)
{
in>>v[i];
}
qsort(0,n-1);
for(i=0;i<n;i++)
{
out<<v[i]<<" ";
}
return 0;
}