2016年10月_Zelda256

原创【数据结构】算法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 1435

原创【数据结构】算法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 852

原创【数据结构】算法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 643

原创【数据结构】算法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 940

原创【数据结构】算法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 1612

原创【数据结构】算法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 869

原创【数据结构】算法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 437

原创【数据结构】算法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 748

原创【数据结构】算法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 848

原创【数据结构】算法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 641

原创【数据结构】算法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 454

原创【数据结构】算法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 647

原创【数据结构】算法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 443

原创【数据结构】算法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 579

原创【数据结构】算法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 719

原创【数据结构】算法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 747

原创【数据结构】算法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 1348

原创【数据结构】算法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 1242

原创【数据结构】算法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 2194

原创【数据结构】算法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 1426

原创【数据结构】算法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 1047

原创【数据结构】算法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 641

原创【数据结构】算法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 815

原创【数据结构】算法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 805

原创【数据结构】算法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 802

原创【数据结构】算法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 1383

原创【数据结构】算法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 1258

原创【数据结构】算法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 1833

原创【数据结构】算法7.6 广度优先搜索

#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:12:17 538

原创【数据结构】算法7.4-7.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 -2#define MAX 20#define INFINITY 65535 //最大

2016-10-10 21:10:54 661

原创【数据结构】算法7.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 MAX_VERTEX_NUM 20 //最大顶点个数typedef in

2016-10-10 21:05:57 618

原创【数据结构】算法7.1-7.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 INFINITY 65535 //最大值∞#define MAX_

2016-10-10 21:04:47 1329

原创【数据结构】算法6.16 N皇后问题

#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//直接修改N可算不同N值的N皇后问题#define N 4typedef int S

2016-10-10 21:02:04 862

原创【数据结构】算法6.14-6.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;// 6.15 是 6.14 的求精后的算法，只完成

2016-10-10 20:57:57 536

原创【数据结构】算法6.12-6.13 求赫夫曼编码

#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{ unsi

2016-10-10 20:56:29 1131

原创【数据结构】算法6.8-6.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 MAX_TREE_SIZE 100typedef int Status;

2016-10-10 20:54:25 1601

原创【数据结构】算法6.5-6.7 线索二叉树

#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 char TElemType;typedef enum {Link, T

2016-10-10 20:47:40 681

原创【数据结构】算法6.1-6.4 遍历二叉树

#include<stdio.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define SIZE 100typedef int Status;typedef char TElemType;typ

2016-10-10 20:45:38 2229

原创【数据结构】算法5.5-5.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 40#define MAXSTRLEN 6 //最大字符

2016-10-10 20:40:27 3036 1

原创【数据结构】算法5.4 十字链表-创建

#include<stdio.h>#include<string.h>#include<stdlib.h>#include<stdarg.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typede

2016-10-10 20:37:42 1885

socket.io实现的在线聊天程序DEMO

数据结构严蔚敏版 建立词索引表

C语言课程设计 通讯录管理系统

模拟x86 cpu的软件

js用post上传数据到服务器，responseText返回错误

数据结构严蔚敏版建立词索引表

C语言课程设计通讯录管理系统