C语言快速排序法

#include

void quickSort(int arr[],int low,int hight);

void quickSort(int arr[],int low,int hight)

{

int i,j,t,tmp;

if (low < hight)

{

i = low;

j = hight;

t = arr[low];

while(i < j)

{

while(i < j && arr[j] > t)

{

j--;

}

if (i < j)

{

// tmp = arr[i];

// arr[i] = arr[j];

// arr[j] = tmp;

arr[i] = arr[j];

i++; 

}

while(i < j && arr[i] <= t)

{

i++;

}

if (i < j)

{

// tmp = arr[j];

// arr[j] = arr[i];

// arr[i] = tmp;

arr[j] = arr [i];

j--;

}

}

arr[i] = t;

quickSort(arr,low,i-1);

quickSort(arr,i+1,hight);

}

}

int main(int argc, const char * argv[]) {

int arr[] = {32,6,3,7,1,86};

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

quickSort(arr,0,len -1);

for (int i = 0; i < len; ++i)

{

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

}

    

    return 0;

}