快速排序

#include<iostream>
using namespace std;

void quicksort(int s[],int left,int right)
{
	if(left<right)                   //140910实现时忘记if导致程序溢出
	{
	int i=left,j=right;
	int index=s[left];
	while(i<j)
	{
		while(i<j && s[j]>index)
			j--;
			s[i]=s[j];
		while(i<j && s[i]<index)
			i++;
			s[j]=s[i];
	}
		s[j]=index;
		quicksort(s,left,i-1);
		quicksort(s,i+1,right);
	}
}

int main( ) {

	int a[]={4,6,3,11,56,31,55,7,1,10};
	quicksort(a,0,9);
	for(int n=0;n<10;n++)
	cout<<a[n]<<' ';
	cout<<endl;
	
	system("pause");
	return 0;
}