https://blog.youkuaiyun.com/cp1995921zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/cp1995921/article/details/78582415https://blog.youkuaiyun.com/cp1995921/article/details/78582415cp1995921Mon, 20 Nov 2017 15:04:41 +0800https://blog.youkuaiyun.com/cp1995921/article/details/78582404https://blog.youkuaiyun.com/cp1995921/article/details/78582404cp1995921Mon, 20 Nov 2017 15:03:52 +0800https://blog.youkuaiyun.com/cp1995921/article/details/78582393https://blog.youkuaiyun.com/cp1995921/article/details/78582393cp1995921Mon, 20 Nov 2017 15:03:09 +0800https://blog.youkuaiyun.com/cp1995921/article/details/78582384https://blog.youkuaiyun.com/cp1995921/article/details/78582384cp1995921Mon, 20 Nov 2017 15:02:13 +0800https://blog.youkuaiyun.com/cp1995921/article/details/78582344https://blog.youkuaiyun.com/cp1995921/article/details/78582344cp1995921Mon, 20 Nov 2017 14:58:38 +08000)个互不相交的有限集T1,T2,…,Tm。其中每个集合本身又是一棵树，称为原来树的子树(SubTree) 子树是不相交的 除了根节点以外，每个结点有且仅有一个父结点；一棵N个结点的树有N-1条边 树的术语结点的度(Degree)：结点的子树个数]]>https://blog.youkuaiyun.com/cp1995921/article/details/78582298https://blog.youkuaiyun.com/cp1995921/article/details/78582298cp1995921Mon, 20 Nov 2017 14:55:36 +0800 #define MaxSize 20typedef struct LNode *List; struct LNode{ ElementType Data[MaxSize]; int length; }; /*顺序查找(Sequential Search)，采用了建立哨兵的查找思想，最好查找复杂度O(1),最坏为O(n)]]>https://blog.youkuaiyun.com/cp1995921/article/details/78582266https://blog.youkuaiyun.com/cp1995921/article/details/78582266cp1995921Mon, 20 Nov 2017 14:53:05 +0800 #include #define ElementType i]]>https://blog.youkuaiyun.com/cp1995921/article/details/78582248https://blog.youkuaiyun.com/cp1995921/article/details/78582248cp1995921Mon, 20 Nov 2017 14:51:55 +0800 #define MaxSize 20 #define ElementType int #define ERROR -1 struct QNode{ ElementType Data[MaxSize]; int front; int rear; }; typedef struct QNode *Queu]]>https://blog.youkuaiyun.com/cp1995921/article/details/78582234https://blog.youkuaiyun.com/cp1995921/article/details/78582234cp1995921Mon, 20 Nov 2017 14:50:58 +0800 #include #define ElementType int /*堆栈的链式存储实现*/ typedef struct SNode *Stack; struct SNode{ ElementType Data; struct SNode *Next; }; Stack CreateStack() { //构造一个堆]]>https://blog.youkuaiyun.com/cp1995921/article/details/78582221https://blog.youkuaiyun.com/cp1995921/article/details/78582221cp1995921Mon, 20 Nov 2017 14:50:02 +0800Top==MA]]>https://blog.youkuaiyun.com/cp1995921/article/details/78571478https://blog.youkuaiyun.com/cp1995921/article/details/78571478cp1995921Sat, 18 Nov 2017 21:39:55 +0800https://blog.youkuaiyun.com/cp1995921/article/details/78571067https://blog.youkuaiyun.com/cp1995921/article/details/78571067cp1995921Sat, 18 Nov 2017 20:38:16 +0800 #include typedef struct LNode *List; struct LNode{ int Data; List Next; }; struct LNode L; List PtrL;/*用链表遍历的方法求表长，时间复杂度为O(n)*/ int Length(List PtrL) { List p]]>https://blog.youkuaiyun.com/cp1995921/article/details/78571060https://blog.youkuaiyun.com/cp1995921/article/details/78571060cp1995921Sat, 18 Nov 2017 20:37:32 +0800 #include #define MAXSIZE 20 typedef struct LNode *List; struct LNode{ int Data[MAXSIZE]; int Last; }; struct LNode L; List PtrL;List MakeEmpty() { List PtrL;]]>https://blog.youkuaiyun.com/cp1995921/article/details/78571016https://blog.youkuaiyun.com/cp1995921/article/details/78571016cp1995921Sat, 18 Nov 2017 20:31:41 +0800 int main() { int a=1234; float b=123.456; double c=12345.54321; printf("\n%2d,%2.1f,%2.11f",a,b,c); }/* %d 有符号10进制整数 %i 有符号10进制整数 %o 有符号8进制整数 %u 无符号10进制整数 %x 无符号的16进]]>https://blog.youkuaiyun.com/cp1995921/article/details/78570982https://blog.youkuaiyun.com/cp1995921/article/details/78570982cp1995921Sat, 18 Nov 2017 20:27:23 +0800 #include typedef struct PolyNode *Polynomial; struct PolyNode{ int coef; int expon; Polynomial link; }; void Attach(int c,int e,Polynomial *pRear) //pRear是指]]>https://blog.youkuaiyun.com/cp1995921/article/details/78570955https://blog.youkuaiyun.com/cp1995921/article/details/78570955cp1995921Sat, 18 Nov 2017 20:23:18 +0800 #include #include #define MAXK 1e7clock_t start,stop; double duration;/*一种复杂度为O(n^3)的暴力解法*/ int MaxSubseqSum1(int A[],int N) { int ThisSum,MaxSum=0; int i,j]]>https://blog.youkuaiyun.com/cp1995921/article/details/78570912https://blog.youkuaiyun.com/cp1995921/article/details/78570912cp1995921Sat, 18 Nov 2017 20:15:00 +0800 #include #include clock_t start,stop; double duration; #define MAXN 10//多项式最大项数，即多项式阶数+1 #define MAXK 1e7//被测函数最大重复调用次数 //一]]>https://blog.youkuaiyun.com/cp1995921/article/details/78570865https://blog.youkuaiyun.com/cp1995921/article/details/78570865cp1995921Sat, 18 Nov 2017 20:09:56 +0800/*循环执行*/ void printn(int N) { int i; for(i=0;ihttps://blog.youkuaiyun.com/cp1995921/article/details/78570588https://blog.youkuaiyun.com/cp1995921/article/details/78570588cp1995921Sat, 18 Nov 2017 19:21:47 +0800