<![CDATA[aytfly的专栏]]>https://blog.csdn.net/aytflyzh-cnhttps://blog.csdn.net/<![CDATA[VS 快捷键]]>https://blog.csdn.net/aytfly/article/details/21721193https://blog.csdn.net/aytfly/article/details/21721193aytflyFri, 21 Mar 2014 15:30:41 +0800<![CDATA[多态是如何实现的]]>https://blog.csdn.net/aytfly/article/details/12850199https://blog.csdn.net/aytfly/article/details/12850199aytflyFri, 18 Oct 2013 11:02:08 +0800<![CDATA[c/c++里的 堆区 栈区 静态区 文字常量区 程序代码区]]>https://blog.csdn.net/aytfly/article/details/11263423https://blog.csdn.net/aytfly/article/details/11263423aytflyFri, 06 Sep 2013 19:30:42 +0800<![CDATA[C语言：浮点数在内存中的表示]]>https://blog.csdn.net/aytfly/article/details/11145247https://blog.csdn.net/aytfly/article/details/11145247aytflyThu, 05 Sep 2013 15:38:29 +0800<![CDATA[C语言printf及参数压栈顺序]]>https://blog.csdn.net/aytfly/article/details/11139517https://blog.csdn.net/aytfly/article/details/11139517aytflyThu, 05 Sep 2013 14:58:15 +0800<![CDATA[图的遍历（BFS, DFS)源代码]]>https://blog.csdn.net/aytfly/article/details/11072019https://blog.csdn.net/aytfly/article/details/11072019aytflyWed, 04 Sep 2013 16:30:49 +0800<![CDATA[B树的实现与源代码二（删除源代码）]]>https://blog.csdn.net/aytfly/article/details/10973787https://blog.csdn.net/aytfly/article/details/10973787aytflyTue, 03 Sep 2013 12:38:48 +0800leaf ) { return x->key[x->size - 1]; } else { return BTreeMaximum( x->child[x->size] ); } } int BTreeMinimum( BNode *x ) { if ( x->leaf ) { return]]><![CDATA[B树的实现与源代码一]]>https://blog.csdn.net/aytfly/article/details/10926369https://blog.csdn.net/aytfly/article/details/10926369aytflyMon, 02 Sep 2013 17:50:51 +0800=2），则B树满足如下要求：（参考算法导论） （1）  每个非根节点至少包含t-1个关键字，t个指向子节点的指针；至多包含2t-1个关键字，2t个指向子女的指针（叶子节点的子女为空）。 （2）  节点的所有key按非降序存放，假设节点的关键字分别为K[1], K[2] … K[n], 指向子女的指针分别为P[1], P[2]…P[n+1]，其中n为节点关键字]]><![CDATA[动态规划——0-1背包问题]]>https://blog.csdn.net/aytfly/article/details/10553069https://blog.csdn.net/aytfly/article/details/10553069aytflyThu, 29 Aug 2013 20:24:13 +0800<![CDATA[动态规划——最长公共子序列（LCS）]]>https://blog.csdn.net/aytfly/article/details/10365509https://blog.csdn.net/aytfly/article/details/10365509aytflyMon, 26 Aug 2013 22:32:21 +0800<![CDATA[动态规划——矩阵链相乘]]>https://blog.csdn.net/aytfly/article/details/10303011https://blog.csdn.net/aytfly/article/details/10303011aytflySun, 25 Aug 2013 16:07:59 +0800<![CDATA[动态规划——装配线调度]]>https://blog.csdn.net/aytfly/article/details/10011943https://blog.csdn.net/aytfly/article/details/10011943aytflyFri, 16 Aug 2013 22:06:10 +0800<![CDATA[红黑树的创建、插入和删除等源代码]]>https://blog.csdn.net/aytfly/article/details/9364421https://blog.csdn.net/aytfly/article/details/9364421aytflyThu, 18 Jul 2013 10:46:55 +0800<![CDATA[二叉查找树的各种操作源码]]>https://blog.csdn.net/aytfly/article/details/9015553https://blog.csdn.net/aytfly/article/details/9015553aytflyMon, 03 Jun 2013 17:41:40 +0800<![CDATA[散列表（哈希表）各种方法实现]]>https://blog.csdn.net/aytfly/article/details/8988517https://blog.csdn.net/aytfly/article/details/8988517aytflyWed, 29 May 2013 11:19:43 +0800<![CDATA[散列表]]>https://blog.csdn.net/aytfly/article/details/8986920https://blog.csdn.net/aytfly/article/details/8986920aytflyTue, 28 May 2013 22:34:15 +0800<![CDATA[构造、析构函数的调用顺序及VC6.0和VC2010中实现的差别]]>https://blog.csdn.net/aytfly/article/details/8969107https://blog.csdn.net/aytfly/article/details/8969107aytflyFri, 24 May 2013 11:31:21 +0800<![CDATA[二叉树的非递归遍历]]>https://blog.csdn.net/aytfly/article/details/8965713https://blog.csdn.net/aytfly/article/details/8965713aytflyThu, 23 May 2013 15:57:02 +0800<![CDATA[二叉树的初始化及遍历]]>https://blog.csdn.net/aytfly/article/details/8965664https://blog.csdn.net/aytfly/article/details/8965664aytflyThu, 23 May 2013 15:51:47 +0800<![CDATA[单链表及转置]]>https://blog.csdn.net/aytfly/article/details/8962309https://blog.csdn.net/aytfly/article/details/8962309aytflyWed, 22 May 2013 20:42:39 +0800