C++语言快速排序

#include<iostream>
using namespace std;
void quickSort(int a[], int, int);
int main()
{
	int array[] = { 34,65,12,43,67,5,78,10,3,70,43,43,65 }, k;
	int len = sizeof(array) / sizeof(int);
	cout << "The orginal arrayare:" << endl;
	for (k = 0; k < len; k++)
		cout << array[k] << ",";
	cout << endl;
	quickSort(array, 0, len - 1);
	cout << "The sorted arrayare:" << endl;
	for (k = 0; k < len; k++)
		cout << array[k] << ",";
	cout << endl;
	system("pause");
	return 0;
}

void quickSort(int s[], int m, int n)
{
	if (m < n)
	{
		int i = m, j = n, x = s[m], temp;
		while (i < j)
		{
			while (i < j && s[j] >= x) // 从右向左找第一个小于x的数
				j--;
			if (i < j)
				s[i++] = s[j];
			while (i < j && s[i] <= x) // 从左向右找第一个大于x的数
				i++;
			if (i < j)
				s[j--] = s[i];

		}
		s[i] = x;
		quickSort(s, m, i - 1); // 递归调用
		quickSort(s, i + 1, n);
	}
}

#include<iostream>
using namespace std;
void quickSort(int a[], int, int);
int main()
{
	int array[] = { 34,65,12,43,67,5,78,10,3,70,43,43,65 }, k;
	int len = sizeof(array) / sizeof(int);
	cout << "The orginal arrayare:" << endl;
	for (k = 0; k < len; k++)
		cout << array[k] << ",";
	cout << endl;
	quickSort(array, 0, len - 1);
	cout << "The sorted arrayare:" << endl;
	for (k = 0; k < len; k++)
		cout << array[k] << ",";
	cout << endl;
	system("pause");
	return 0;
}

void quickSort(int s[], int m, int n)
{
	if (m < n)
	{
		int i = m, j = n, x = s[m], temp;
		while (i < j)
		{
			while (i < j && s[j] > x) // 从右向左找第一个小于等于x的数
				j--;
			if (i < j)
				s[i++] = s[j];
			while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数
				i++;
			if (i < j)
				s[j--] = s[i];

		}
		s[i] = x;
		quickSort(s, m, i - 1); // 递归调用
		quickSort(s, i + 1, n);
	}
}