**分治算法:通过一趟排序,将数据拆分为两个部分A,B,A比B小(或者大);
之后再用这种方法,分别拆分A部分和B部分,
A分为A1,A2,A1比A2小(或者大)
B分为B1,B2,B1比B2大(或者小)
…
…
…
递归调用,直至分割到只剩一个元素,完成排序。
步奏如下:
a.设置变量i和变量j,记录第一个数据和 最后一条数据,使用变量key记录序列中第一条
记录的键值,集Key=a[0]
b.若i<j成立
比较a[j]和key,若key>a[j],使a[i]==a[j];否则元素下标从后往前移动,j–;
比较a[i]和key,若key<a[i],是a[i]==a[j],否则元素下标从前往后移动,i++;
c.重复上述步奏b,知道i<j不成立位置,此时a[i]=key
原始数据:10,1231,124,21,421,21,421,421,4,5
排序结果:
第一趟排序结果:4,5,10,21,421,21,421,421,124,1231
第二趟排序结果:4,5,10,21,21,124,421,421,421,1231
第三趟排序结果:4,5,10,21,21,124,421,421,421,1231
第四趟排序结果:4,5,10,21,21,124,421,421,421,1231
第五趟排序结果:4,5,10,21,21,124,421,421,421,1231
第六趟排序结果:4,5,10,21,21,124,421,421,421,1231
#include<iostream>
#include<string>
using namespace std;
void quick_sort(int a[], int left, int right) {
if (left >= right) {
return;
}
int i = left;
int j = right;
int key = a[i];
while (i < j) {
while (i<j&&key <= a[j]) {
j--;
}
a[i] = a[j];
while (i<j&&key >= a[i]) {
i++;
}
a[j] = a[i];
}
a[i] = key;
quick_sort(a, left, i - 1);
quick_sort(a, i + 1, right);
for (int m = 0; m < 10; m++)
cout << "," << a[m];
cout << endl;
};
int main() {
int a[10] = { 10,1231,124,21,421,21,421,421,4,5 };
quick_sort(a,0,9);
cout << "排序后的结果是:" << endl;
for (int i = 0; i < 10; i++) {
cout << a[i] << endl;
}
system("pause");
return 0;
}