算法
花海_
一个不务正业的程序员
展开
-
堆排序
includeinclude using namespace std; void max_heapify(vector &nums, int beg, int end); void heap_sort(vector &nums) { int n = nums.size(); for (int i = n / 2 - 1; i >= 0; ...原创 2018-08-21 13:12:34 · 366 阅读 · 0 评论 -
快速排序
#include<iostream>#include <vector>using namespace std;int partition(vector<int>& v, int low, int high){ int pivot = v[high]; int i = low - 1; for (int j = low;...原创 2018-08-21 13:28:56 · 348 阅读 · 0 评论