编辑代码

#include<iostream>
using namespace std;
void Quick_Sort(int *arr, int begin, int end){
    if(begin >= end)
        return;
    int temp = arr[begin];
    int i = begin;
    int j = end;
    while(i != j)
	{
        while(arr[j] >= temp && j > i)
            j--;
        while(arr[i] <= temp && j > i)
            i++;
        if(j > i){
            int t = arr[i];
            arr[i] = arr[j];
            arr[j] = t;
        }
    }
    arr[begin] = arr[i];
    arr[i] = temp;
    Quick_Sort(arr, begin, i-1);
    Quick_Sort(arr, i+1, end);
}
int main()
{
	int arr[11]={11,9,20,7,56,9,42,3,7,15,16};
	int begin=0;
	int end=10;
	Quick_Sort(arr,begin,end);
	for(int i=0;i<11;i++)
	{
		cout<<arr[i]<<",";
	}
	cout<<endl;
	cout<<"最小值为"<<arr[0]<<"最大值为"<<arr[10];
}