快排（QuickSort）

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>

void swap(int* left, int* right)
{
int temp = left;
left = right;
right = temp;
}
int Partion(int array, int left, int right)
{
int begin = left;
int end = right - 1;
int key = array[right - 1];
while (begin<end)
{
while (begin < end && array[begin] <= key)
begin++;
while (begin < end && array[end] >= key)
end–;
if (begin != end)
swap(&array[begin], &array[end]);
}
if (begin != right - 1)
swap(&array[begin], &array[right - 1]);
return begin;
}
void QuickSort(int array, int left, int right)
{
if (right - left > 1)
{
int div = Partion(array, left, right);
QuickSort(array, left, div);
QuickSort(array, div + 1, right);
}
}
/
void BubbleSort(int array, int size)
{

}
/
void PrintArray(int array, int size)
{
for (int i = 0; i < size; ++i)
printf("%d “, array[i]);
printf(”\n");
}
int main()
{
int array[10] = { 2, 6, 5, 8, 3, 1, 0, 4, 7, 9 };
PrintArray(array, sizeof(array) / sizeof(array[0]));
QuickSort(array, 0,sizeof(array) / sizeof(array[0]));
PrintArray(array, sizeof(array) / sizeof(array[0]));
system(“pause”);
return 0;
}

来源：https://blog.csdn.net/hertioy/article/details/98884535