算法快速排序

#define _CRT_SECURE_NO_WARNINGS

#include<stdio.h>

void QuickSort(int arr[ ], int low, int high)

{

int left, right;

if(low < high)

{

left = low;

right = high;

int temp = arr[low];

do

{

while(left < right && arr[right] > temp)

{

right--;

}

if(left < right)

{

arr[left++] = arr[right];

}

while(left < right && arr[left] <= temp)

{

left++;

}

if(left < right)

{

arr[right--] = arr[left];

}

}while(left != right);

arr[left] = temp;

QuickSort(arr, low, left - 1);

QuickSort(arr, left + 1, high);

}

}

int main( )

{

int arr[7] = { 1, 3, 5, 7, 2, 4, 6 };

int sz = sizeof(arr) / sizeof(arr[0]);

Quick_Sort(arr, 0, 6);

int i = 0;

for(i = 0; i < sz; i++)

{

printf(" %d ", arr[i]);

}

return 0;

}