原理:
具体实现代码:
#include<iostream>
using namespace std;
//快排
void quick_sort(int s[], int left, int right)
{
if (left < right)
{
int i = left, j = right, x = s[left];
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 < j &&必须要有才行
i++;
if (i < j)
s[j--] = s[i];
} s[i] = x;
quick_sort(s, left, i - 1); // 递归调用
quick_sort(s, i + 1, right);
}
}
int main()
{
int a[10], i, n = 10, num = 10;
for (i = 0; i < n; i++)
a[i] = num--;
cout << "原序列:\n";
for (i = 0; i < n; i++)
cout << a[i] << " ";
quick_sort(a,0,9);
cout << "排序后:\n";
for (i = 0; i < n; i++)cout << a[i] << " ";
return 0;
}