算法 - 交换排序（C++）

╰半夏微凉° 2022-04-22 01:04 217阅读 0赞

**分享一下我老师大神的人工智能教程！零基础，通俗易懂！[http://blog.csdn.net/jiangjunshow][http_blog.csdn.net_jiangjunshow]**

**也欢迎大家转载本篇文章。分享知识，造福人民，实现我们中华民族伟大复兴！**

/*SwapSort.cpp - by Chimomo在程序设计中，交换排序是基本排序方法的一种。所谓交换，就是根据序列中两个记录键值的比较结果来对换这两个记录在序列中的位置，交换排序的特点是：将键值较大的记录向序列的尾部移动，键值较小的记录向序列的前部移动。*/#include <iostream>using namespace std;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 temp = a[i];    a[i] = a[j];    a[j] = temp;   }  }  cout << "Round " << i + 1 << ": ";  for (int i = 0; i < 10; i++)  {   cout << a[i] << " ";  }  cout << endl; }}void main(){ int a[10] = { 1, 6, 4, 2, 8, 7, 9, 3, 10, 5 }; cout << "Before Swap Sort:" << endl; for each (int i in a) {  cout << i << " "; } cout << endl << endl; SwapSort(a, 10); cout << endl << "After Swap Sort:" << endl; for each (int i in a) {  cout << i << " "; } cout << endl;}// Output:/*Before Swap Sort:1 6 4 2 8 7 9 3 10 5In Swap Sort:Round 1: 1 6 4 2 8 7 9 3 10 5Round 2: 1 2 6 4 8 7 9 3 10 5Round 3: 1 2 3 6 8 7 9 4 10 5Round 4: 1 2 3 4 8 7 9 6 10 5Round 5: 1 2 3 4 5 8 9 7 10 6Round 6: 1 2 3 4 5 6 9 8 10 7Round 7: 1 2 3 4 5 6 7 9 10 8Round 8: 1 2 3 4 5 6 7 8 10 9Round 9: 1 2 3 4 5 6 7 8 9 10After Swap Sort:1 2 3 4 5 6 7 8 9 10*/

#### 给我老师的人工智能教程打call！[http://blog.csdn.net/jiangjunshow][http_blog.csdn.net_jiangjunshow] ####

![这里写图片描述][SouthEast]

[http_blog.csdn.net_jiangjunshow]: https://blog.csdn.net/jiangjunshow/article/details/77338485
[SouthEast]: /images/20220422/f3eb404ae3964ba8827c1641f71c5fc1.png