堆排序与TopK问题c++源码
#include <iostream>using namespace std;#include <vector>//调整数组v以i位置为根的子树为小根堆,数组堆的范围0到k-1void HeadAdjustDown(vector<int>& v, int i, int k);//对前k个元素建立小根堆void BuildMinHeap(vector<int>& v, int k);//取最小k个数void GetLeastNu
原创
2022-05-18 19:14:28 ·
187 阅读 ·
0 评论