C语言(C LANGUAGE)
文章平均质量分 76
holoto
这个作者很懒,什么都没留下…
展开
-
栈的应用->中缀转后缀
#include "20150518.c"int main(){ stack z1, z2; z1 = createstack(15);//数据栈 z2 = createstack(15);//临时栈 char *s = "a*b*c+(d*e+f)*g#";//3*3-3+3*(7-9) int b = 0;原创 2015-08-13 15:30:16 · 406 阅读 · 0 评论 -
线索树
#include #include #include #include #define element_type inttypedef element_type* element_point;typedef struct thread_btree *thread_point;typedef enum {link, thread} sign;typedef struct thread原创 2015-08-29 11:58:37 · 452 阅读 · 0 评论 -
栈的应用--简单计算器---加减乘除
源文件 1#include #include #include #include #define emptytos (-1)//空栈#define minstacksize (5)//最小栈大小//typedef char element;#define element int//顺序栈的实现typedef struct stackrecord{ int ca原创 2015-08-14 18:52:11 · 1323 阅读 · 0 评论 -
队列的实现
#include #include #include #include #include #define element int#define max__queue 10typedef struct queue{ element *array; int capacity;//队列预分配大小 int front;//队头--删除原创 2015-08-16 11:28:53 · 344 阅读 · 0 评论 -
优先队列_二叉堆
#include #include #include #include #define element_type int//堆 数据类型#define minheadsize 10//最小堆容量#define mindata 0//堆 游标哨兵typedef element_type* element_point;//堆指针typedef struct headqueue *pri原创 2015-09-01 11:45:12 · 388 阅读 · 0 评论 -
劳动几天的单向链表
//有点渣#include #include #define stu structtypedef stu student{ int number; stu student *next;}a,*d;a *creat(int b);a *del(a *h,int s);int main(){ a *b,*d;原创 2015-06-19 15:31:02 · 409 阅读 · 0 评论 -
栈的顺序存储结构
#include #include #include #include #define element inttypedef element *integer_point;#define stack_init_size 100typedef struct stack{ element *base; element *top;原创 2015-08-10 16:05:04 · 467 阅读 · 0 评论 -
最大子数组问题
#include #include #include typedef struct num{ int left_place, right_place, max_num;} num;extern void displayarray(const int *a, const int n)/***显示数组元素值*/{ int b原创 2015-08-04 21:48:10 · 418 阅读 · 0 评论 -
归并排序
#include #include #include static void merge(int *a, const int start, const int mid, const int end){ int start1 = start, start2 = mid + 1, end1 = mid, end2 = end; int *tmp =原创 2015-08-03 18:56:21 · 337 阅读 · 0 评论