/// <summary>
/// 快速排序
/// </summary>
/// <param name="sums"></param>
/// <param name="start"></param>
/// <param name="end"></param>
void QuickSort(int[] sums,int start,int end)
{
if (start >= end)
return;
int s = start;
int e = end;
int num = sums[start];
while (start < end)
{
while (sums[end] > num && end > start)
{
end--;
}
while (sums[start] <= num && start < end)
{
start++;
}
int x = sums[start];
sums[start] = sums[end];
sums[end] = x;
}
sums[s] = sums[start];
sums[start] = num; //插入值
QuickSort(sums, s, start - 1); //向左排序
QuickSort(sums, end + 1, e); //向右排序
}
