C++之快排

#include <iostream>;
#include <vector>;
//快排算法
using namespace std;
void quick_sort(int* arr, int low1, int high1) {
	if (low1 >= high1) {	//若待排序序列只有一个元素，返回空 
		return;
	}
	int left, right, value;
		//默认选中最左边的
	left = low1; value = arr[low1];
	right = high1;
	while (left < right) {
		cout << arr[left] << "and" << right << endl;
		while (arr[right] >= value && left < right) {
			right--;
		}
		arr[left] = arr[right];
		while (arr[left] <= value && left < right) {
			left++;
		}
		arr[right] = arr[left];
	};
	arr[left] = value;
	quick_sort(arr, low1, left - 1);
	quick_sort(arr, left + 1, high1);
}

//快速排序
#include <iostream> 
#include <vector>

using namespace std;
extern void quick_sort(int* arr, int low1, int high1);

int main() {
	
	int array1[] = { 1,49,38,65,97,76,13,27,49 };
	int length = sizeof(array) / sizeof(*array);
	cout << "原始序列：";
	for (int i = 0; i < length; i++) {
		cout << array[i] << " ";
	}
	cout << endl;
	
	quick_sort(array1, 0, length - 1);
	cout << "快排序列1：";
	for (int i = 0; i < length; i++) {
		cout << array[i] << " ";
	}
	return 0;
}