![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
排序算法
会飞的星星0312⭐️
这个作者很懒,什么都没留下…
展开
-
快速排序
#include #include using namespace std; void Quicksort(vector& vec, int low, int high) { if (low >= high) return; int key = vec[low]; int i = low + 1, j = high; while (i < j) { if (vec[i] <= key) ++i; if (vec[j] > key) --j; if (i<j &原创 2020-08-06 15:17:05 · 77 阅读 · 0 评论 -
归并排序
#include #include using namespace std; void Merge(vector& vec, int low, int mid, int high); void Msort(vector& vec, int low, int high) { if (low >= high) return; int mid = (high + low) / 2; Msort(vec, low, mid); Msort(vec, mid + 1, high); Me原创 2020-08-06 15:15:18 · 72 阅读 · 0 评论 -
堆排序
#include #include using namespace std; void HeadAdjust(vector& vec, int star, int len) { int left = 2 * star + 1; int right = 2 * star + 2; if (left < len && vec[star] < vec[left]) { int temp = vec[star]; vec[star] = vec[left]; vec[left]原创 2020-08-06 15:12:34 · 126 阅读 · 1 评论 -
插入排序
#include #include using namespace std; //插入排序 int main() { //vector vec = { 10,3,8,4,12,0,3,1,2 }; vector vec = { 2,3,4,5,15,19,16,27,36,4,38,44,46,47,48,50 }; int len = vec.size(); for (int i = 1; i < len; ++i) { if (vec[i] < vec[i-1]) { int j = i原创 2020-08-06 15:09:21 · 76 阅读 · 0 评论 -
选择排序
#include #include using namespace std; //选择排序 int main() { vector vec = { 10,3,8,4,12,0,3,1,2 }; int len = vec.size(); for (int i = 0; i < len - 1; ++i) { int min_index = i; for (int j = i + 1; j < len; ++j) if (vec[j] < vec[min_index]) min_i原创 2020-08-06 15:07:52 · 65 阅读 · 0 评论 -
冒泡排序
#include #include using namespace std; //冒泡排序 int main() { vector vec = { 10,3,6,8,12,3,1,0 }; int len = vec.size(); for(int i = 0; i < len - 1; ++i) for (int j = 0; j < len - i - 1; ++j) { if (vec[j] > vec[j + 1]) { int temp = vec[j+1]; vec[j+1]原创 2020-08-06 15:06:31 · 84 阅读 · 0 评论 -
希尔排序:
#include #include using namespace std; //希尔排序: int main() { //vector vec = { 2,3,4,5,15,19,16,27,36,38,44,46,47,48,50 }; vector vec = { 3, 5, 3, 0, 8, 6, 1, 5, 8, 6, 2, 4, 9, 4, 7, 0, 1, 8, 9, 7, 3, 1, 2, 5, 9, 7, 4, 0, 2, 6 }; //vector vec = { 0,5,3,4,原创 2020-08-06 15:02:32 · 67 阅读 · 0 评论