![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
Zelda256
while(alive)
{
eat();
sleep();
code();
}
展开
-
【数据结构】算法10.15-10.17 链式基数排序
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1typedef int Status;typedef int ElemType;#define MAX_NUM_OF_KEY 8原创 2016-10-11 14:24:05 · 1418 阅读 · 0 评论 -
【数据结构】算法9.3-9.4 静态树表-构造次优查找树
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define LIST_INIT_SIZE 100 //存储空间的初始分配量typedef原创 2016-10-10 21:46:47 · 728 阅读 · 0 评论 -
【数据结构】算法9.2 有序表查找-折半查找
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_INIT_SIZE 100 //存储空间的初始分配量#defin原创 2016-10-10 21:45:56 · 1309 阅读 · 0 评论 -
【数据结构】算法9.1 顺序表查找-顺序查找
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_INIT_SIZE 100 //存储空间的初始分配量#defin原创 2016-10-10 21:45:07 · 1227 阅读 · 0 评论 -
【数据结构】算法8.3 广义表遍历算法
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;#def原创 2016-10-10 21:44:00 · 2159 阅读 · 0 评论 -
【数据结构】算法8.2 伙伴系统-分配
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW_SELF -2#define M 3 //可利用空间总容原创 2016-10-10 21:43:15 · 1357 阅读 · 0 评论 -
【数据结构】算法8.1 边界标识法-分配
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAX 1000#define E 10#define FootLoc原创 2016-10-10 21:42:21 · 1007 阅读 · 0 评论 -
【数据结构】算法7.16 Floyd算法 各对顶点间最短路径
这个程序 输出路径的时候有点问题。#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAX 20 //最大顶点个数#d原创 2016-10-10 21:41:05 · 597 阅读 · 0 评论 -
【数据结构】算法7.15 Dijkstra算法 单源点最短路径
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAX_VERTEX_NUM 20 //最大顶点个数#define原创 2016-10-10 21:39:54 · 793 阅读 · 0 评论 -
【数据结构】算法7.13-7.14 AOE-网 关键路径
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;typ原创 2016-10-10 21:38:48 · 788 阅读 · 0 评论 -
【数据结构】算法7.12 AOV-网 拓扑排序
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;typ原创 2016-10-10 21:31:46 · 785 阅读 · 0 评论 -
【数据结构】算法7.10-7.11 DFS求无向图关节点
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;typ原创 2016-10-10 21:27:00 · 1338 阅读 · 0 评论 -
【数据结构】算法9.5-9.8 二叉排序树
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)原创 2016-10-10 21:47:35 · 704 阅读 · 0 评论 -
【数据结构】算法9.9-9.12 平衡二叉树
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)原创 2016-10-10 21:48:25 · 566 阅读 · 0 评论 -
【数据结构】算法9.13-9.14 B树-插入&查找
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW_SELF -2#define EQ(a,b) ((a) ==原创 2016-10-10 21:49:21 · 416 阅读 · 0 评论 -
【数据结构】算法10.11-10.14 2-路归并排序
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)原创 2016-10-11 14:22:55 · 838 阅读 · 0 评论 -
【数据结构】算法10.10-10.11 堆排序
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)原创 2016-10-11 14:22:03 · 610 阅读 · 0 评论 -
【数据结构】算法10.9 选择排序-简单选择排序
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)原创 2016-10-11 14:21:04 · 878 阅读 · 0 评论 -
【数据结构】算法10.6-10.8 快速排序
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)原创 2016-10-11 14:20:16 · 1572 阅读 · 0 评论 -
【数据结构】算法10.4-10.5 插入排序-希尔
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;typ原创 2016-10-11 14:17:36 · 809 阅读 · 0 评论 -
【数据结构】算法10.3 插入排序-表插入
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAXINT -1#define EQ(a,b) ((a) == (b)原创 2016-10-11 14:16:12 · 424 阅读 · 0 评论 -
【数据结构】算法10.2 插入排序-折半插入
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)原创 2016-10-11 14:15:22 · 694 阅读 · 0 评论 -
【数据结构】算法10.1 插入排序-直接插入
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define EQ(a,b) ((a) == (b))#define LT(a,b)原创 2016-10-10 21:52:38 · 808 阅读 · 0 评论 -
【数据结构】算法9.17-9.18 哈希表-插入&查找
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int KeyType;type原创 2016-10-10 21:51:37 · 607 阅读 · 0 评论 -
【数据结构】算法9.16 键树-Trie树-查找
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<ctype.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define MAXKEYLEN 16typedef int Status;typed原创 2016-10-10 21:50:40 · 434 阅读 · 0 评论 -
【数据结构】算法9.15 键树-双链树-查找
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;#def原创 2016-10-10 21:50:03 · 629 阅读 · 0 评论 -
【数据结构】算法7.9 普里姆算法-无向网最小生成树
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;#def原创 2016-10-10 21:18:59 · 1237 阅读 · 0 评论 -
【数据结构】算法7.7-7.8 无向图的连通分量和生成树
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAXSIZE 20 //最大顶点数typedef int Statu原创 2016-10-10 21:13:21 · 1800 阅读 · 0 评论 -
【数据结构】算法4.9-4.14 建立词索引表
#include<stdio.h>#include<string.h>#include<stdlib.h>#include <conio.h>#include <ctype.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define OVERFLOW -2#define MaxBookNum 1000 //假设只原创 2016-10-10 20:18:36 · 1549 阅读 · 0 评论 -
【数据结构】算法4.6-4.7 KMP算法
#include <stdio.h>#include <string.h>char S[20]="ABCDEFGHIJK";char T[5]="DEFG";int next[5];int pos=0;/*******************************声明部分****************************************/int index_KMP(char原创 2016-10-10 20:16:48 · 558 阅读 · 1 评论 -
【数据结构】算法4.5 不依赖其他串操作的Index
//求子串位置的定位函数#include<stdio.h>#include<string.h>#include<stdlib.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define OVERFLOW -2#define MAXSTRLEN 255#define MAXSIZE 40 //最大字符串typed原创 2016-10-10 20:15:39 · 937 阅读 · 0 评论 -
【数据结构】算法4.4 串插入操作
/* 串的堆分配存储表示 */#include<stdio.h>#include<string.h>#include<stdlib.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define OVERFLOW -2typedef int Status;typedef struct{ char *c原创 2016-10-10 20:14:14 · 2230 阅读 · 0 评论 -
【数据结构】算法4.2&4.3 串连接Concat&求子串SubString
/* 串的定长顺序存储表示 */#include<stdio.h>#include<string.h>#include<stdlib.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 40#define MAXSTRLEN 6 //最大字符串typedef int Status;t原创 2016-10-10 20:11:58 · 6970 阅读 · 0 评论 -
【数据结构】算法4.1 定位函数Index
#include<stdio.h>#include<string.h>#include<stdlib.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 40 //最大字符串typedef int Status;typedef char SString[MAXSIZE+1];//此处声明的原创 2016-10-10 19:55:39 · 6683 阅读 · 0 评论 -
【数据结构】循环队列
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<conio.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef原创 2016-10-10 19:53:59 · 613 阅读 · 2 评论 -
【数据结构】算法3.3 迷宫求解
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define STACK_INIT_SIZE 100 //存储空间初始分配量#de原创 2016-10-10 19:52:15 · 5769 阅读 · 4 评论 -
【数据结构】算法3.1-3.2 栈的顺序存储表示
#include<stdio.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;//typedef int SElemType;typedef char SElem原创 2016-10-10 19:48:18 · 568 阅读 · 0 评论 -
【数据结构】算法2.22-2.23 一元多项式的表示及相加
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef struct{ int原创 2016-10-10 19:26:59 · 3386 阅读 · 0 评论 -
【数据结构】算法2.8-2.122 线性表的单链表
#include<stdio.h>#include<string.h>#include<stdlib.h>//函数结果状态代码#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int El原创 2016-10-10 19:23:40 · 672 阅读 · 1 评论 -
【数据结构】算法5.1-5.2 三元组顺序表-转置
#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAXSIZE 125 //假设非零元个数的最大值为125 //原书为原创 2016-10-10 20:20:04 · 3521 阅读 · 0 评论