Pagini recente » Borderou de evaluare (job #2458300) | Cod sursa (job #3135210) | Borderou de evaluare (job #1301908) | Cod sursa (job #706349) | Cod sursa (job #608573)
Cod sursa(job #608573)
#include <fstream.h>
#define MAX 500002
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[MAX];
void quicksort(int start,int stop);
int main()
{
int i,j,p,n,aux;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
quicksort(1,n);
for(i=1;i<=n;i++)
g<<v[i]<<" ";
f.close();
g.close();
return 0;
}
void quicksort(int start, int stop)
{
int i,p,j,aux;
if(stop-start<1) return;
i=start;
j=stop;
p=v[(i+j)/2];
while(i<j)
{
while(v[i]<p)
i++;
while(v[j]>p)
j--;
if(i<j)
{
aux=v[i], v[i]=v[j], v[j]=aux;
if(v[i]==v[j]) j--;
}
}
quicksort(start,i);
quicksort(i+1,stop);
}