排序算法
就是写点基础的排序算法自己看
恩嗯
一个正在学习的,普通人
展开
-
归并排序
#include <iostream>#include <vector>using namespace std;void Show(vector<int> & vec){ vector<int> :: iterator it = vec.begin(); for(it;it != vec.end();it++) { cout<<*it<<" "; } c原创 2020-08-04 23:38:09 · 119 阅读 · 0 评论 -
堆排序
#include <iostream>#include <vector>using namespace std;void Swap(int &a,int &b){ int tmp = a; a = b; b = tmp;}void Show(vector<int> & vec){ vector<int> :: iterator it = vec.begin(); for(i原创 2020-08-04 23:37:25 · 139 阅读 · 0 评论 -
基数排序
#include <iostream>#include <vector>#include <queue>using namespace std;void Show(vector<int> & vec){ vector<int> :: iterator it = vec.begin(); for(it;it != vec.end();it++) { cout<<*it<原创 2020-08-04 23:36:39 · 126 阅读 · 0 评论 -
快排
#include <iostream>#include <vector>using namespace std;void Swap(int &a,int &b){ int tmp = a; a = b; b = tmp;}void Show(vector<int> & vec){ vector<int> :: iterator it = vec.begin(); for(原创 2020-07-27 23:11:02 · 126 阅读 · 0 评论 -
希尔排序
#include <iostream>#include <vector>using namespace std;void Swap(int &a,int &b){ int tmp = a; a = b; b = tmp;}void Show(vector<int> & vec){ vector<int> :: iterator it = vec.begin(); for(原创 2020-07-27 23:09:15 · 101 阅读 · 0 评论 -
直接插入排序
#include <iostream>#include <vector>using namespace std;void Swap(int &a,int &b){ int tmp = a; a = b; b = tmp;}void Show(vector<int> & vec){ vector<int> :: iterator it = vec.begin(); for(原创 2020-07-27 23:06:39 · 105 阅读 · 0 评论 -
选择排序
#include <iostream>#include <vector>using namespace std;void Swap(int &a,int &b){ int tmp = a; a = b; b = tmp;}void Show(vector<int> & vec){ vector<int> :: iterator it = vec.begin(); for(原创 2020-07-27 23:04:12 · 101 阅读 · 0 评论 -
冒泡排序
#include <iostream>#include <vector>using namespace std;void Swap(int &a,int &b){ int tmp = a; a = b; b = tmp;}void Show(vector<int> & vec){ vector<int> :: iterator it = vec.begin(); for(原创 2020-07-27 23:02:09 · 110 阅读 · 0 评论