排序算法
神山极客
C++入门
展开
-
堆排序
#include <iostream> #include <vector> #include <algorithm> #include <iterator> void MaxHeap(std::vector<int>& nums, int start, int end) { int father = start; int child = (father << 1) + 1; while (child &...原创 2021-02-22 23:16:02 · 74 阅读 · 0 评论 -
归并排序
#include <vector> #include <algorithm> #include <iterator> #include <iostream> void Merge(std::vector<int>& nums, std::vector<int>& res, int left, int mid, int right) { int left1 = left, right1 = mid; int lef.原创 2021-02-22 22:17:58 · 86 阅读 · 0 评论 -
快速排序
#include <vector> #include <algorithm> #include <iterator> #include <iostream> int GetPivot(std::vector<int>& nums, int low, int high) { int pivot = nums[low]; while (low < high) { while (low < high && .原创 2021-02-22 20:41:34 · 75 阅读 · 0 评论