尝试用C++写快速排序

#include <iostream>
using namespace std;

void quick_sort(int arr[], int left, int right) {
	int i;
	int j;
	int num;
	int key;//用来存基准值

	i = left;
	j = right;
	key = arr[left];

	if (left > right) {
		return;
	}

	while (i != j) {
		while (arr[j] >= key && i < j)
			j--;//从右往左寻找比基准值小的数

		while (arr[i] <= key && i < j)
			i++;//从左往右寻找比基准值大的数

		if (i < j) {
			num = arr[i];
			arr[i] = arr[j];
			arr[j] = num;
		}//交换两者的位置
	}

	arr[left] = arr[i];
	arr[i] = key;//将基准值与最左测值相交换

	quick_sort(arr, left, i - 1);
	quick_sort(arr, i + 1, right);//递归

	return;
}

int main() {
	int arr[100];
	int number;

	cout << "请输入你想排序数的个数:" << endl;
	cin >> number;

	for (int i = 1; i <= number; i++) {
		cin >> arr[i];
	}

	quick_sort(arr, 1, number);

	for (int i = 1; i <= number; i++) {
		cout << arr[i];
	}

	cout << endl;

	return 0;
}