排序算法--快速排序

//快速排序
void quick_sort(int *arr, int low, int hight)
{
int i = 0;
int j = 0;
int pos = 0;
if (low < hight)
{
i = low;
j = hight;
pos = arr[low];
while (i < j)
{
while (i < j && pos<= arr[j])
j--;
if (i < j)
{
arr[i++] = arr[j];
}


while (i<j&&pos>=arr[i])
i++;
if (i < j)
{
arr[j--] = arr[i];
}
arr[i] = pos;
quick_sort(arr, low, i);
quick_sort(arr, i+1 , hight);
}
}
}