Question

quick sort problem

Answer 1

void quicksort(int *array,int first,int last)
{
if(first>=last)
return;
int pivot=partition(array,first,last);
quicksort(array,first,pivot-1);
quicksort(array,pivot+1,last);
}
int partition(int *array,int first,int last)
{
int start,end;
start=first;
end=last+1;
while(1)
{
while(array[start]>array[++first])
{
if(start==last)
break;
}
while(array[start]<array[--end])
{
if(end==first)
break;
}
if(start>=end)
break;
swap(array,start,end);
}
swap(array,first,end);
return(end);
}
void swap(int *array,int first,int last)
{
int temp;
temp=array[first];
array[first]=array[last];
array[last]=temp;
return;
}