常见排序算法C++实现--QuickSort，MergeSort

快速排序

void QuickSort(vector<int>& num, int l, int r) {
	if (l < r) {
		int pivot = Partition(num, l, r);
		QuickSort(num, l, pivot - 1);
		QuickSort(num, pivot + 1, r);
	}
}

int Partition(vector<int>& num, int l, int r) {
	int pivot = num[l];
	while (l < r) {
		while (l < r && num[r] >= pivot)
			r--;
		num[l] = num[r];
		while (l < r && num[l] <= pivot)
			l++;
		num[r] = num[l];
	}
	num[l] = pivot;
	return l;
}

归并排序

void Merge(vector<int>& num, int l, int m, int r) {
	vector<int> newnum;
	int i = l, j = m + 1;
	while (i <= m && j <= r) {
		if (num[i] < num[j]) {
			newnum.push_back(num[i++]);
		}
		else {
			newnum.push_back(num[j++]);
		}
	}
	while (i <= m) {
		newnum.push_back(num[i++]);
	}
	while (j <= r) {
		newnum.push_back(num[j++]);
	}
	for (int i = l; i <= r; i++) {
		num[i] = newnum[i - l];
	}
}

void MergeSort(vector<int>& num, int l, int r) {
	if (l < r) {
		int m = l + (r - l) / 2;
		MergeSort(num, l, m);
		MergeSort(num, m + 1, r);
		Merge(num, l, m, r);
	}
}