Pagini recente » Cod sursa (job #1144838) | Cod sursa (job #312483) | Cod sursa (job #2253897) | Cod sursa (job #3286332) | Cod sursa (job #1673775)
#include <fstream>
using namespace std;
void quick(int l,int r,int *v)
{
int i,j,p,aux;
j=l-1;
p=*(v+r);
for(i=l;i<=r;i++)
{
if(*(v+i)<=p)
{
j++;
aux=*(v+i);
*(v+i)=*(v+j);
*(v+j)=aux;
}
}
if(l<j-1)
{
quick(l,j-1,v);
}
if(j+1<r)
{
quick(j+1,r,v);
}
}
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
int n;
in>>n;
int i,v[n];
for(i=0;i<n;i++)
{
in>>v[i];
}
quick(0,n-1,&v[0]);
for(i=0;i<n;i++)
{
out<<v[i]<<" ";
}
return 0;
}