快速排序

#include <stdio.h>
void output(int* arr,int length);
int pivotIndex(int* arr,int first,int last);
void qSort(int*arr,int first,int last);
void quickSort(int*arr);
int main()
{
	int arr[10]={3,2,1,5,4,6,8,7,9,0};
	output(arr,10);
	quickSort(arr);
	output(arr,10);
	return 0;
}
void quickSort(int*arr)
{
qSort(arr,0,10);
}
void qSort(int*arr,int first,int last)
{
	int index;
	if(last-first<=1)
	{
		return;
	}
	else if(first==last-2)
	{
		if(arr[first]>arr[last-1])
		{
			int temp=arr[last-1];
			arr[last-1]=arr[first];
			arr[first]=temp;
		}
		else
		return;
	}
	else
	{
		index=pivotIndex(arr,first,last);
		qSort(arr,first,index);
		qSort(arr,index+1,last);
	}
}
int pivotIndex(int* arr,int first,int last)
{
	int mid=(first+last)/2;
	int pivot=arr[mid];
	int scanUp=first+1;
	int scanDown=last-1;
	arr[mid]=arr[first];
	arr[first]=pivot;
	while(true)
	{
		while(arr[scanUp]<pivot&&scanUp<=scanDown)
		{
			scanUp++;
		}
		while(arr[scanDown]>pivot)
		{
			scanDown--;
		}
		if(scanUp>=scanDown)
		{
			break;
		}
		else
		{
			int temp;
			temp=arr[scanUp];
			arr[scanUp]=arr[scanDown];
			arr[scanDown]=temp;
		}

	}	
	arr[first]=arr[scanDown];
	arr[scanDown]=pivot;
	return scanDown;

}
void output(int* arr,int length)
{
	for(int i=0;i<length;i++)
	{
		printf("%d ",arr[i]);
	}
	printf("\n");
}