<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Welcome]]></title><description><![CDATA[自此华山一条路，再无初秋，少天真。]]></description><link>https://blog.youkuaiyun.com/Coreever</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Coreever]]></copyright><item><title><![CDATA[《常见计算机术语缩写》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/41276779</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/41276779</guid><author>Coreever</author><pubDate>Wed, 19 Nov 2014 09:16:43 +0800</pubDate><description><![CDATA[常见缩写]]></description><category></category></item><item><title><![CDATA[《W3School XML学习小结_02》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/41276599</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/41276599</guid><author>Coreever</author><pubDate>Wed, 19 Nov 2014 09:08:22 +0800</pubDate><description><![CDATA[基本概念]]></description><category></category></item><item><title><![CDATA[《W3School XML学习小结_01》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/41241345</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/41241345</guid><author>Coreever</author><pubDate>Tue, 18 Nov 2014 07:58:37 +0800</pubDate><description><![CDATA[基本概念]]></description><category></category></item><item><title><![CDATA[《严蔚敏数据结构_15》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/40989141</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/40989141</guid><author>Coreever</author><pubDate>Mon, 10 Nov 2014 22:09:06 +0800</pubDate><description><![CDATA[基本概念
树的基本术语：


结点：数据元素+若干指向子树的分枝
结点的度：分枝的个数
树的度：树中所有结点的度的最大值
叶子结点：度为零的结点
分枝结点：度大于零的结点


路径：由从根到某个结点所经过的分枝和结点构成的


结点的层次：假设根结点的层次为1，第l层的结点的子树根结点的层次为l+1


树的深度：树中叶子结点所在的最大层次


森林：m（m]]></description><category></category></item><item><title><![CDATA[《严蔚敏数据结构_08》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/40989029</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/40989029</guid><author>Coreever</author><pubDate>Mon, 10 Nov 2014 22:03:40 +0800</pubDate><description><![CDATA[基本概念
在表达式的前缀式、中缀式、后缀式里是没有括弧的


无论表达式采用哪种方式操作数的相对位置是不变的，不同的只是操作数的位置


中缀式丢失了括弧信息致使运算次序不确定


前缀式的运算规则：连续出现的两个操作数和在它们之前且紧靠它们的运算符构成一个最小表达式


后缀表达式的运算规则：运算符在式中的出现顺序与元表达式中的计算顺序一致


求后缀表达式：先求]]></description><category></category></item><item><title><![CDATA[《严蔚敏数据结构_09》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/40988821</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/40988821</guid><author>Coreever</author><pubDate>Mon, 10 Nov 2014 22:03:04 +0800</pubDate><description><![CDATA[基本概念]]></description><category></category></item><item><title><![CDATA[《严蔚敏数据结构_03》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/40351713</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/40351713</guid><author>Coreever</author><pubDate>Tue, 21 Oct 2014 21:33:59 +0800</pubDate><description><![CDATA[基本概念]]></description><category></category></item><item><title><![CDATA[《严蔚敏数据结构_02》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/40349937</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/40349937</guid><author>Coreever</author><pubDate>Tue, 21 Oct 2014 19:52:07 +0800</pubDate><description><![CDATA[基本概念
1.时间复杂度：算法在最坏情况下的渐近时间复杂度。]]></description><category></category></item><item><title><![CDATA[《可汗学院-线性代数小结》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/40296163</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/40296163</guid><author>Coreever</author><pubDate>Mon, 20 Oct 2014 09:44:09 +0800</pubDate><description><![CDATA[1.]]></description><category></category></item><item><title><![CDATA[《指针》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/40272021</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/40272021</guid><author>Coreever</author><pubDate>Sun, 19 Oct 2014 21:50:35 +0800</pubDate><description><![CDATA[#include
using namespace std;
int main()
{
    int a[10] = {1,2,3,4,5,6,7,8,9,10};
    int *p;
    p = a;
    printf("%d\n",*(a + 2));
    printf("%d\n",*(p + 2));// *p
    return 0;
}]]></description><category></category></item><item><title><![CDATA[《w3school-XML》学习小结]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/39930785</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/39930785</guid><author>Coreever</author><pubDate>Thu, 09 Oct 2014 14:44:10 +0800</pubDate><description><![CDATA[一、语法规则
    1.XML中必须有关闭标签，没有关闭标签被视为不合法； 

        Error:  This is a page.
         Correct:  This is a page. 

    2.XML标签对大小写敏感；

	  与 是两个不同的标签；
	因此XML必须使用相同的大小写来编写打开和关闭标签
	Error:  something 
	]]></description><category></category></item><item><title><![CDATA[《严蔚敏数据结构_01》]]></title><link>https://blog.youkuaiyun.com/Coreever/article/details/39551757</link><guid>https://blog.youkuaiyun.com/Coreever/article/details/39551757</guid><author>Coreever</author><pubDate>Thu, 25 Sep 2014 15:28:29 +0800</pubDate><description><![CDATA[基本概念]]></description><category></category></item></channel></rss>