快速排序_quicksort

quicksort algorithm

#include<bits/stdc++.h>
using namespace std;

int qsl(vector<int>& num, int l, int r)
{
	if (l > r) { return 0; }
	int temp = num[l];
	while (l != r)
	{
		while (l < r && num[r] >= temp)--r;
		num[l] = num[r];
		while (l < r && num[l] <= temp)++l;
		num[r] = num[l];
	}
	num[l] = temp;
	return l;

}

void sort(vector<int>& num, int l, int r)
{
	if (l > r) return;
	else
	{
		int pos = qsl(num, l, r);
		sort(num, l, pos - 1);
		sort(num, pos + 1, r);
	}
}

int main()
{
	vector<int>ans;
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		int t;
		cout << "input " << "the " << i << "th num" << endl;
		cin >> t;
		ans.push_back(t);
	}

	sort(ans, 0, n - 1);
	for (int i = 0; i < ans.size(); ++i)
	{
		cout << ans[i] << " ";
	}
	return 0;
}
/*quick sort*/