数据结构中的排序--快速排序

快速排序可以先参考：https://baike.baidu.com/item/%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95/369842?fr=aladdin

#include "stdafx.h"
#include <iostream>
using namespace std;

void print(int data[], int n)
{
	for (int i = 0; i < n; i++)
	{
		cout << data[i] << " ";
	}
	cout << endl;
}

void quick_ascending_sort(int data[], int len, int low, int high)
{
	int i = 0, j = 0, temp = 0, d = 0;

	if (low >= high)
	{
		return;
	}
	temp = data[low];
	i = low;
	j = high;
	while (i < j)
	{
		/*比temp小的元素移到低端*/
		while (i < j && data[j] >= temp)//
			j--;
		if (i < j)
			data[i++] = data[j];
		/*比temp大的元素移到高端*/
		while (i < j && data[i] <= temp)
			i++;
		i