算法
ReaFly
计算机视觉 研究生
展开
-
冒泡排序
// Author: FF-w// Date: 24, Sep, 2018// Purpose: Bubble Sort#includeusing namespace std;void bubble_sort(int array[],int arrayLength){int i,j,temp;for(i=0;i<arrayLength-1;i++){for(j=0;j...原创 2018-09-24 16:13:55 · 180 阅读 · 0 评论 -
循环日程表问题(分治法)
//Author:FF-W//Date: 24, Sep, 2018//Purpose:循环日程表#include <iostream>using namespace std;void copy_dataTime(int, int**);void recursive_arrangement(int**,int);void print_data(int**, int...原创 2018-09-24 19:59:38 · 746 阅读 · 1 评论 -
0-1背包问题(动态规划)
//Author:FF-W//Data:25, Sep, 2018//Purpose: 0-1背包问题#include <iostream>#include<algorithm>using namespace std;typedef struct{ int value; int weight; int no; bo原创 2018-09-25 21:17:23 · 176 阅读 · 0 评论 -
0-1背包问题(回溯法)
//Author: FFW//Data: 9, Oct, 2018//Purpose: 0-1背包问题(回溯法)#include <iostream>using namespace std;int vBest=0;bool check(int t,int vCurrent,int V[],int nItem){ int vSum=0; for(...原创 2018-10-09 22:10:19 · 195 阅读 · 0 评论 -
0-1背包问题(分支限界-普通队列)
//Author: FF-W//Date: 29, Oct, 2018//Purpose:0-1背包问题(分支限界-普通队列)#include <iostream>#include<queue>using namespace std;class itemNode{public: int cw; int cp; boo原创 2018-10-29 21:57:06 · 1115 阅读 · 0 评论 -
0-1背包问题(分支限界-优先队列)
//Author: FF-W//Date: 29, Oct, 2018//Purpose: 0-1背包问题(分支限界-优先队列)#include <iostream>#include<queue>using namespace std;class itemNode{public: int cw; int cp; bool isl...原创 2018-10-29 22:31:50 · 3700 阅读 · 1 评论