快排算法

递归版

int Partition(std::vector<int> &data, int left, int right)
{
    int i = left;
    int j = right;
    int pivotValue = data[left];
    while (i < j) {
        while (data[j] > pivotValue && i < j) {
            j--;
        }
        if (i < j) {
            data[i] = data[j];
            i++;
        }
        while (data[i] <= pivotValue && i < j) {
            i++;
        }
        if (i < j) {
            data[j] = data[i];
            j--;
        }
    }
    // 归位
    data[i] = pivotValue;
    return i;
}

void QuickSort(std::vector<int> &data, int left, int right) 
{
    int i = 0;
    if (left < right) {
        i = Partition(data, left, right);
        QuickSort(data, left, i - 1);
        QuickSort(data, i + 1, right);
    }

}

void PintVector(std::vector<int> &data)
{
    std::cout << "[ ";
    for (const auto i : data) {
        std::cout << i << ", ";
    }
    std::cout << "]" << std::endl;
}

int main() {
	std::vector<int> data1 = {8, 3, 7 , 5};
	QuickSort(data1, 0, data1.size() - 1);
	PintVector(data1);
	std::vector<int> data2 = { 3, 3, 1, 2, 7 , 5 , 4, 1, 2, };
	QuickSort(data2, 0, data2.size() - 1);
	PintVector(data2);
	std::vector<int> data3 = { 1, 1, 2 , 2, 4 };
	QuickSort(data3, 0, data3.size() - 1);
	PintVector(data3);
	return 0;
}