-
对比(c++ stl书上的)
-
代码实现
#include <iostream> #include <vector> #include <utility> #include <algorithm> using namespace std; #define MAX_LENGTH 32 void printArray(std::vector<int> nArray) { for (auto i : nArray) { cout << i << " "; } cout << endl; } // 冒泡排序 void bubbleSort(std::vector<int> nArray) { int length = nArray.size(); for (int i = 0; i < length; i++) { bool flag = false; for (int j = length - 1; j > i; j--) { if (nArray[j] < nArray[j - 1]) { swap(nArray[j], nArray[j - 1]); flag = true; } } if (!flag) { break; } } cout << "----冒泡排序------" << endl; printArray(nArray); } // 插入排序 void insertQSort(std::vector<int> &nArray) { int length = nArray.size(); for (int i = 1; i < length; i++) { int tmp = nArray[i]; int j = i - 1; while (j >= 0 && tmp < nArray[j]) { nArray[j + 1] = nArray[j]
排序算法2
最新推荐文章于 2023-02-12 20:42:34 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)