#include <iostream>
using namespace std;
int Partition(int a[], int s, int t)
{
int tmp = a[s];
int i = s, j = t;
while (i != j)
{
while (j > i && a[j] >= tmp)
{
j--;
}
a[i] = a[j];
while (i < j && a[i] <= tmp)
{
i++;
}
a[j] = a[i];
}
a[i] = tmp;
return i;
}
void QuickSort(int a[], int s, int t)
{
if (s < t)
{
int i = Partition(a, s, t);
QuickSort(a, s, i - 1);
QuickSort(a, i + 1, t);
}
}
int main()
{
int n = 8;
int a[] = { 2,5,1,7,8,4,44,14 };
QuickSort(a, 0, n - 1);
cout << "结果为" << endl;
cout << "最小的值为"<<a[0]<<"最大的值为" << a[n - 1];
return 0;
}