shakingWaves的专栏

#include #include #include using namespace std;void two_d_rabin_karp_matcher(char **T,int n1,int n2,char **P,int m1,int m2,int d,int q)//二维模式匹配{ int *pattern=new int[m2]; int *text=new int[n2]

#include #include using namespace std;void longest_palindrome(char *s,int **p,int length){ for(int i=0;i<length-1;++i){//初始化数组相关信息 p[i][i]=1; int j=i+1; if(s[i]==s[j]){ p[i][j]=2; }el

#include #include #include#include #include #include using namespace std;using namespace boost::timer;int compare(const void *a,const void *b)//qsort比较函数{ if ( *(double*)a < *(double*)b ) r

#include #include #include using namespace std;using namespace boost::timer;void matrix_multiply(int **a,int **b,int **c,int m,int n,int q)//矩阵乘法{//m,n表示矩阵a的行数和列数，n,q表示矩阵b的行数和列数，c的行数和列数应该为m,q

#include #include #include#include using namespace std;using namespace boost::timer;void lis(int *a,int *s,int *b,int n)//Longest Increasing Subsequence,最长单调递增子序列{ for(int l=1;l<n;++l){//最长子序

#include #include #include using namespace std;using namespace boost::timer;void lcs_length(char *a,int m,char *b,int n,int **c)//最长公共子序列{//自底向上法 for(int i=1;i<=m;++i){ for(int j=1;j<=n;++j)

#include #include #include using namespace std;using namespace boost::timer;int cut_rod(int *p,int n,int *result){ if(n==0) return 0; int q =numeric_limits::min();//q初始为最小值 for(int i=0;i<n;

#include#include #include using namespace std;typedef struct rb_node{//带父节点的红黑树 int value; rb_node *left,*right,*parent; bool rb;//rb=0表示结点,rb=1表示红结点 int min,max,min_gap;//计算红黑树中两个最接近的数的差值}r

#include #includeusing namespace std;typedef struct list{ int value; list *next;}list, *pList;pList build_cirle_list(int n)//创建单向循环链表{ pList head=new list; pList pl,pp=head; for(int i=0;i<

#include#include using namespace std;typedef struct node{//带父节点的二叉树 int value; node *left,*right,*parent;}node,*pNode;void binary_tree_insert(pNode &pn,pNode pz)//二叉树插入操作{ pNode y=NULL; p

#include#include using namespace std;typedef struct node{//带父节点的二叉树 int value; node *left,*right,*parent;}node,*pNode;void build_binary_search_tree(pNode &pn,int n)//建立n个具有父节点的二叉搜索树{ int va

#include#include #include using namespace std;typedef struct rb_node{//带父节点的二叉树 int value; rb_node *left,*right,*parent; bool rb;//rb=0表示结点,rb=1表示红结点 int size;//存储左右子树大小和该结点之和}rb_node,*pRBNo

#include#include #include using namespace std;typedef struct rb_node{//带父节点的二叉树 int value; rb_node *left,*right,*parent; bool rb;//rb=0表示结点,rb=1表示红结点 int size;//存储左右子树大小和该结点之和}rb_node,*pRBNo

#include#include using namespace std;typedef struct avl_node{//AVL树 int value; int height; avl_node *left,*right,*parent;}avl_node,*pAvl_node;void left_rotation(pAvl_node &pn,pAvl_node px)

#include#include #include using namespace std;typedef struct node{//二叉树节点 int value; node *left; node *right;}node,*pnode;typedef struct list{//队列的基本结构 pnode pn; list *next;}list,*plist;

#include #include #include #include using namespace boost::timer;using namespace std;int partition(double *a,int low,int high){ double key=a[high]; int p=low-1; double tmp; for(int i=low;i

#include #include #include #include #include #include #include using namespace std;const static int M = 80;void print_neatly(vector&vec,int **extras,int **lc,int *c,int *p,int n)//整齐打印{ fo

#include #include #include using namespace std;typedef struct point{ int x,y;}point,*ppoint;void quick_sort_partition(ppoint *pp,int low,int high)//快速排序{ while (low<high){ ppoint pKey=pp[

#include #include #include #include using namespace std;//算法导论第三版32.1-4void string_matcher(string &strSrc,vectorvecStr,int index,int pos,vector &vec_result)//查找所有出现的匹配模式{ int depth=vecStr.size

#include #include using namespace std;void extend_shortest_paths(int **matrix,int **W,int **result,int n)//计算最短路径{ for(int i=0;i<n;++i){ for(int j=0;j<n;++j){ int min=numeric_limits::max();

#include #include #include using namespace std;int * compute_prefix_function(string str)//计算字符串的前缀函数{ int m=str.length(); int q=-1; int *prefix_table=new int[m]; prefix_table[0]=q; for(int

#include #include #include using namespace std;typedef struct list{ int id; int left_time; list *next;}list,*plist;typedef struct queue{ list *front; list *tail;}queue,*pqueue;void ini

#include #include #include #include using namespace std;typedef struct fib_heap_node{//斐波那契堆结点 int key;//结点值 int degree;//结点度 fib_heap_node *parent;//结点的父结点 fib_heap_node *left;//结点的左兄弟,循环双链表

#include #include #include using namespace std;typedef struct min_heap{//最小堆 int value; min_heap *left,*right;//左右结点}min_heap,*pmin_heap;typedef struct list{//双向链表实现栈 int value; list *next

#include #include #include using namespace std;typedef struct Link_graphic{//邻接表 int value; Link_graphic *next;}Link_graphic,*pLink_graphic;typedef struct Queue{//队列 Link_graphic *front,*ta

#include#include #include#include using namespace std;int partition(double *ration,int *v,int *w,int low,int high)//快速排序子程序{ double pivot=ration[high]; int k=low-1; double tmp; int tmp2; f

#include#include #includeusing namespace std;void dynamic_max_value_activity_selector(int *s,int *f,int *val,int **c,int **act,int n)//动态规划-自底向上{ for(int i=0;i<n;++i){ c[i][i]=0;//如果只有一个元素，则两

#include#includeusing namespace std;void quick_sort(int *s,int *f,int low,int high)//快速排序，安装活动的开始时间升序排序{ while (low<high){ int pivot=s[high]; int k=low-1; int tmp; for(int i=low;i<high;+

#include#include #includeusing namespace std;typedef struct list{ int tag;//教室编号 int time;//活动的结束时间 list *next;//下一个活动}list ,*plist;void minimum_lecture_hall(plist &busing,plist &free,int *

#include #include using namespace std;#define BTree_T 2#define BTree_N ((2*BTree_T)-1)//BTree_T 表示B树的度,BTree_N表示B树的最大关键字个数typedef struct BTree{ int keyNum;//保存关键字的个数 int key[BTree_N];//存储关键字

#include#include using namespace std;void recursive_activity_selector(int *s,int *f,int l,int h)//递归贪心算法{ int m=l+1; while (m<=h && s[m]<f[l]){ ++m; } if(m<h){ cout<<m<<"\t"; recursive_

#include #include using namespace std;//不相交集合森林typedef struct disjoint_set_forest_node{ int value;//结点值 disjoint_set_forest_node *parent;//父亲结点 int rank;//结点的秩}disjoint_set_forest_node,*pDisjo

#include #include #include using namespace std;typedef struct Link_graphic{//邻接表 int value; Link_graphic *next;}Link_graphic,*pLink_graphic;typedef struct Queue{//队列 Link_graphic *front,*ta

#include#include #include using namespace std;typedef struct dlist{//双向链表 int value;//存储值 unsigned int np;//存储地址值}dlist, *pdlist;void insert(pdlist &d,pdlist cur)//双链表插入元素{ d->np^=(unsigne

#include#include #include using namespace std;typedef struct dlist{//双向链表 int value; dlist *next; dlist *prev;}dlist, *pdlist;void insert(pdlist &d,pdlist cur)//双链表插入元素{ if(!d){ d=cur;

递归法，迭代法，近似值法#include #include using namespace boost::timer;using namespace std;double fib( double n){ if(n<=1) return n; else return fib(n-1) + fib(n-2);}double iteratorfib(double n){

//基于最小堆的K路归并算法#include #include #include using namespace std;typedef struct node{ int value; node *next;}node,*pNode;void insert_node(node *head, node *nenode)//直接插入法，插入新节点{ node *cur=hea

#include #include #include #include using namespace boost::timer;using namespace std;void same_elem_quick_sort(int *a,int low,int high)//考虑相同元素的情况{ if(low<high){ int pivot=a[low]; int i=

#include#include #include using namespace std;void young_tableau(int **a,int i,int j,int m,int n)//维护杨氏矩阵{ int min_row=i,min_col=j; if(i+1a[i+1][j])){//比较当前元素与下边元素值的大小 min_row=i+1; } if(i<

《算法导论》第三版 P43-44#include #include #include using namespace boost::timer;using namespace std;int addrARA[4]={0,0,1,1},addrACA[4]={0,0,0,0}, addrBRA[4]={0,0,0,0},addrBCA[4]={0,1,0,1};int addrA