[Data structures]Stack
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1024 typedef struct _SqStack{ int *base; int *top; int stackSize; }SqStack; int InitStack(SqStack *S) { S->base = (int *)malloc(MAX*sizeof(int)); S->top = S->base; S->stackSi...标签: Data Structures data_structures
[Data structures]Create index lists (An example of string)
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_KEY_NUM 255 #define MAX 255 typedef unsigned char SString[MAX+1]; typedef struct _WordList{ char *item[MAX_KEY_NUM]; int last; }WordList; typedef struct _LinkList{ int book_number; struct _...标签: Data Structures data_structures
[Data structures]String
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 255 typedef unsigned char SString[MAX+1]; int next[MAX]; /* * 0 :j == 1 * k :T[1...k-1] == T[j-(k-1)...j-1] * 1 :Others * */ void get_next(SString T, int next[]) { int i,j; i = 1; nex...标签: Data Structures data_structures
[Data structures]General list
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1024 /* General list */ typedef struct _GLNode{ int tag; //0-atom, 1-node union{ char atom; struct{ struct _GLNode *hp; struct _GLNode *tp; }ptr; }; }GList; int server(...标签: Data Structures data_structures
[Data structures]Orthogonal link
#include <stdio.h> #include <stdlib.h> #define MAX 1024 typedef struct _OLNode{ int i,j; int e; struct _OLNode *right, *down; }OLNode; typedef struct _CrossList{ OLNode **rhead; OLNode **chead; int m,n,t; //m rows, n cols, t none zero }CrossList; int CreateMatr...标签: Data Structures data_structures
[Data structures]Triple sequential matrix
#include <stdio.h> #include <stdlib.h> #define MAX 1024 typedef struct _Triple{ int i,j; int e; }Triple; typedef struct _TSMatrix{ Triple data[MAX+1]; int rpos[MAX+1]; //Sequential table of row logical link int m,n,t; //m rows, n cols, t none zero }TSMatrix; void...标签: Data Structures data_structures
[Data structures]Create binary tree by sequence
#include <stdio.h> #include <stdlib.h> #define MAX 20 typedef struct _BiTree{ char data; struct _BiTree *left; struct _BiTree *right; }BiTree; void CreateByPreInOrder(BiTree **T, char *pre, int pre_begin, int pre_end, char *in, int in_begin, int in_end) { int len; i...标签: Data Structures data_structures
[Data structures]Backtrack
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 20 #define INFINIT 65535 int k; void GetPowerSet(int i, int *A, int *B) { int x; int j; if(i>A[0]){ for(j=1; j<=B[0]; j++){ printf("%d", B[j]); } printf("\n"); }else{ x ...标签: Data Structures data_structures
[Data structures]Huffman
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 20 #define INFINIT 65535 typedef struct _HTNode{ int weight; int parent; int left; int right; }HTNode; void HuffmanCoding(HTNode **HT, char ***HC, int *w, int n) { int i; int m; int m...标签: Data Structures data_structures
[Data structures]Merge forest set
#include <stdio.h> #include <stdlib.h> #define MAX 20 typedef struct _PTreeNode{ int data; int parent; }PTreeNode; typedef struct _PTree{ PTreeNode nodes[MAX]; int n; }PTree; int find_mfset(PTree *S, int i) { int j,k,t; if(i<1 || i>S->n){ return -1...日历
最新微语
- Watching the autumn leaves falling as you grow older together
2018-10-25 09:45
- 时间不可以倒流，但空间可以
2017-08-01 09:03
- 含羞草、电磁炮；汽车工业革命
2017-05-23 22:51
- 那个点子页面加几点：
去中心化的物联网通信协议
2017-05-09 22:13
- 有一种人怀疑阴阳的存在，另有一种人会怀疑1+1＝2的正确性……
2017-03-01 17:08
分类
最新评论
- 萧
@Fluzak：The web host... - Fluzak
Nice blog here! Also... - Albertarive
In my opinion you co... - ChesterHep
What does it plan? - ChesterHep
No, opposite. - mojoheadz
Everything is OK!... - Josephmaigh
I just want to say t... - ChesterHep
What good topic - AnthonyBub
Certainly, never it ... - DavidNed
I think, that you ar...