分享一个大牛的人工智能教程。零基础!通俗易懂!风趣幽默!希望你也加入到人工智能的队伍中来!请点击人工智能教程
/*
* SwapSort.cpp - by Chimomo
*
* 在程序设计中,交换排序是基本排序方法的一种。
* 所谓交换,就是根据序列中两个记录键值的比较结果来对换这两个记录在序列中的位置,
* 交换排序的特点是:将键值较大的记录向序列的尾部移动,键值较小的记录向序列的前部移动。
*/
#include <iostream>
using namespace std;
/**
* Swap sort.
* @param a The array to be sorted.
* @param length The array length to be sorted.
*/
static void SwapSort(int *a, int length) {
cout << "In Swap Sort:" << endl;
for (int i = 0; i < length - 1; i++) {
for (int j = i + 1; j < length; j++) {
if (a[i] > a[j]) {
int t = a[i];
a[i] = a[j];
a[j] = t;
}
}
// Print each round of iteration.
cout << "Round " << i + 1 << ": ";
for (int i = 0; i < 10; i++) {
cout << a[i] << " ";
}
cout << endl;
}
}
int main() {
int a[10] = {1, 6, 4, 2, 8, 7, 9, 3, 10, 5};
cout << "Before Swap Sort:" << endl;
for (int i:a) {
cout << i << " ";
}
cout << endl << endl;
SwapSort(a, 10);
cout << endl << "After Swap Sort:" << endl;
for (int i:a) {
cout << i << " ";
}
cout << endl;
}
// Output:
/*
Before Swap Sort:
1 6 4 2 8 7 9 3 10 5
In Swap Sort:
Round 1: 1 6 4 2 8 7 9 3 10 5
Round 2: 1 2 6 4 8 7 9 3 10 5
Round 3: 1 2 3 6 8 7 9 4 10 5
Round 4: 1 2 3 4 8 7 9 6 10 5
Round 5: 1 2 3 4 5 8 9 7 10 6
Round 6: 1 2 3 4 5 6 9 8 10 7
Round 7: 1 2 3 4 5 6 7 9 10 8
Round 8: 1 2 3 4 5 6 7 8 10 9
Round 9: 1 2 3 4 5 6 7 8 9 10
After Swap Sort:
1 2 3 4 5 6 7 8 9 10
*/