算法分析
cjliux
这个作者很懒,什么都没留下…
展开
-
算法分析之众数问题O(nlogn)
#include#includeusing namespace std;int mode(vector& a, int left, int right, int& num) { int L = left, R = right; int T = a[L]; while (L < R) { while (a[R] >= T && L < R) --R; a[L] = a[R]原创 2016-10-02 09:04:12 · 3805 阅读 · 0 评论 -
算法分析之有重复元素的排列问题O(n!)
#include#include#includeusing namespace std;templatevoid quicksort(vector& a, int left, int right, vector& next){ int L = left, R = right; eT T = a[L]; while (L < R) { while (a[R] >= T &&原创 2016-10-02 10:03:37 · 2495 阅读 · 0 评论 -
算法分析之半数集自底向上
#include#includeusing namespace std;int main(void){ int n; vector hset; hset.push_back(1); while (cin >> n) { if (hset.size() >= n + 1) cout << hset[n] << endl; else { for (int i原创 2016-10-08 11:34:10 · 692 阅读 · 0 评论