data struct
文章平均质量分 77
hahaliu005
这个作者很懒,什么都没留下…
展开
-
Realize the linear list with C
header.c#include #include #include #include #include #include #include #include #define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1typedef int Status;type转载 2012-12-31 23:11:54 · 344 阅读 · 0 评论 -
The express of stack squenced
SqStack.c#define STACK_INIT_SIZE 100#define STACKINCREMENT 10typedef struct{ SElemType *base; SElemType *top; int stacksize;}SqStack;Status InitStack(SqStack *S){ (*S).base = (SElemType *转载 2013-01-13 15:20:16 · 281 阅读 · 0 评论 -
Polynomial use LinkList
Polynomial.c#include "LinkList.c"typedef LinkList polynomial;#define DestroyPolyn DestroyList#define PolynLength ListLengthStatus OrderInsertMerge(LinkList *L , ElemType e , int(*compare)(ter转载 2013-01-12 23:48:47 · 492 阅读 · 0 评论 -
Doubly linked list
DuLinkList.ctypedef struct DuLNode{ ElemType data; struct DuLNode *prior , *next;}DuLNode,*DuLinkList;Status InitList(DuLinkList *L){ *L = (DuLinkList)malloc(sizeof(DuLNode)); if(*L){ (*L)转载 2013-01-12 22:08:51 · 398 阅读 · 0 评论 -
The operate of stack
typedef char SElemType;#include "header.c"#include "SqStack.c"SElemType Precede(SElemType t1 , SElemType t2){ SElemType f; switch(t2){ case '+': case '-':if(t1 == '(' || t1 == '#'){ f = '<转载 2013-01-19 22:39:20 · 337 阅读 · 0 评论 -
Another Single Link List
SLinkList.cstruct LNode{ ElemType data; struct LNode *next;};typedef struct LNode *LinkList;Status InitList(LinkList *L){ *L = (LinkList)malloc(sizeof(struct LNode)); if(!*L){ exit(OVERFL转载 2013-01-14 00:27:18 · 336 阅读 · 0 评论 -
The using of stack
#include "header.c"typedef char SElemType;#include "LinkStack.c"//conversion decimal to octalvoid conversion(){ LinkStack S; int N,e; InitStack(&S); printf("Enter a decimal : "); scanf("%d",原创 2013-01-19 21:34:09 · 293 阅读 · 0 评论 -
Link Stack
LinkStack.ctypedef SElemType ElemType;#include "SLinkList.c"typedef LinkList LinkStack;#define InitStack InitList#define DestroyStack DestroyList#define ClearStack ClearList#define StackEmp转载 2013-01-14 01:33:54 · 521 阅读 · 0 评论 -
data struct algo 2-1
#include "header.c"#include "sqList.c"//algo 2-1Status MergeList(SqList La , SqList Lb , SqList *Lc){ int i , j , k = 0 , La_len , Lb_len; ElemType *a,*b,ai,bj; InitList(Lc); La_len = ListLeng转载 2013-01-01 14:57:19 · 422 阅读 · 0 评论 -
Single link list
LinkList.ctypedef struct LNode{ ElemType data; struct LNode *next;}*Link , *Position , LNode;typedef struct { Link head , tail; int len;}LinkList;Status MakeNode(Link *p , ElemType e){ *转载 2013-01-13 16:22:11 · 485 阅读 · 0 评论