数据结构_algorithm
文章平均质量分 73
manoel
这个作者很懒,什么都没留下…
展开
-
【数据结构】散列表_HashTable
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* 存储空间初始分配量 */原创 2013-11-15 11:44:06 · 11527 阅读 · 0 评论 -
【数据结构】邻接表深度和广度遍历DFS_BFS
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 9 /* 存储空间初始分配量 */#d原创 2013-11-14 17:16:13 · 10956 阅读 · 0 评论 -
【数据结构】二叉树顺序结构实现_BiTreeArray
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* 存储空间初始分配量 */原创 2013-11-14 13:30:06 · 5639 阅读 · 0 评论 -
【数据结构】线索二叉树_ThreadBinaryTree
#include "string.h"#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE原创 2013-11-14 13:31:03 · 7962 阅读 · 0 评论 -
【数据结构】串_String
#include "string.h"#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE原创 2013-11-14 10:50:06 · 2524 阅读 · 0 评论 -
【数据结构】静态链表_StaticLinkList
#include "string.h"#include "ctype.h" #include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define原创 2013-11-14 08:59:26 · 2271 阅读 · 0 评论 -
【数据结构】顺序栈_Stack
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */t原创 2013-11-14 09:36:10 · 1644 阅读 · 0 评论 -
【数据结构】链队列_LinkQueue
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */t原创 2013-11-14 09:40:07 · 1850 阅读 · 0 评论 -
【数据结构】排序_Sort
#include #include #include #include #include #include #include #define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAX_LENGTH_INSERT_SORT 7 /* 用于快速排序时判断是否选用插入原创 2013-11-15 11:44:20 · 12307 阅读 · 1 评论 -
【数据结构】最小生成树_Prim
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXEDGE 20#define MAXVEX 20原创 2013-11-14 17:16:58 · 10596 阅读 · 0 评论 -
【数据结构】邻接矩阵创建_CreateMGraph
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXVEX 100 /* 最大顶点数,应由用户定义 */原创 2013-11-14 17:14:39 · 10238 阅读 · 0 评论 -
【数据结构】线性表链式存储_LinkList
#include "stdio.h" #include "string.h"#include "ctype.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define原创 2013-11-14 08:58:41 · 2683 阅读 · 0 评论 -
【数据结构】线性表顺序存储_List
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */原创 2013-11-14 08:52:19 · 2605 阅读 · 0 评论 -
【数据结构】链栈_LinkStack
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */t原创 2013-11-14 09:37:54 · 3445 阅读 · 0 评论 -
【数据结构】拓扑排序_TopologicalSort
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXEDGE 20#define MAXVEX 14原创 2013-11-14 17:19:21 · 10503 阅读 · 0 评论 -
【数据结构】二叉排序树_BinarySortTree
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* 存储空间初始分配量 */原创 2013-11-15 11:41:46 · 10875 阅读 · 0 评论 -
【数据结构】B树_BTree
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* 存储空间初始分配量 */原创 2013-11-15 11:43:30 · 12765 阅读 · 0 评论 -
【数据结构】静态查找_Search
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* 存储空间初始分配量 */原创 2013-11-15 11:40:33 · 10046 阅读 · 0 评论 -
【数据结构】关键路径_CriticalPath
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXEDGE 30#define MAXVEX 30原创 2013-11-14 17:19:58 · 11657 阅读 · 0 评论 -
【数据结构】最短路径_Floyd
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXEDGE 20#define MAXVEX 20原创 2013-11-14 17:19:23 · 10680 阅读 · 0 评论 -
【数据结构】最短路径_Dijkstra
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXEDGE 20#define MAXVEX 20原创 2013-11-14 17:18:51 · 11618 阅读 · 0 评论 -
【数据结构】最小生成树_Kruskal
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0typedef int Status; /* Status是函数的类型,原创 2013-11-14 17:17:35 · 10669 阅读 · 0 评论 -
【数据结构】邻接矩阵深度和广度遍历DFS_BFS
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0typedef int Status; /* Status是函数的类型,原创 2013-11-14 17:15:40 · 12702 阅读 · 0 评论 -
【数据结构】邻接表创建_CreateALGraph
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXVEX 100 /* 最大顶点数,应由用户定义 */原创 2013-11-14 17:15:01 · 16191 阅读 · 1 评论 -
【数据结构】二叉树链式结构实现_BiTreeLink
#include "string.h"#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE原创 2013-11-14 13:30:53 · 4981 阅读 · 0 评论 -
【数据结构】模式匹配_KMP
#include "string.h"#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 1原创 2013-11-14 10:50:55 · 3307 阅读 · 0 评论 -
【数据结构】两栈共享空间_DoubleStack
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */t原创 2013-11-14 09:36:50 · 2098 阅读 · 0 评论 -
【数据结构】斐波那契函数_Fibonacci
#include "stdio.h"int Fbi(int i) /* 斐波那契的递归函数 */{ if( i < 2 ) return i == 0 ? 0 : 1; return Fbi(i - 1) + Fbi(i - 2); /* 这里Fbi就是函数自己,等于在调用自己 */} int main(){ int i; int a[40]; pr原创 2013-11-14 09:39:14 · 2049 阅读 · 0 评论 -
【数据结构】平衡二叉树_AVLTree
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* 存储空间初始分配量 */原创 2013-11-15 11:42:22 · 11203 阅读 · 0 评论 -
【数据结构】顺序队列_Queue
#include "stdio.h" #include "stdlib.h" #include "io.h" #include "math.h" #include "time.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 20 /* 存储空间初始分配量 */t原创 2013-11-14 09:39:25 · 1676 阅读 · 0 评论