<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[paul777chen的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/paul777chen</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; paul777chen]]></copyright><item><title><![CDATA[Chapter3 Growth of Functions]]></title><link>https://blog.youkuaiyun.com/paul777chen/article/details/44203087</link><guid>https://blog.youkuaiyun.com/paul777chen/article/details/44203087</guid><author>paul777chen</author><pubDate>Wed, 11 Mar 2015 19:35:06 +0800</pubDate><description><![CDATA[3.1 渐近记号θ\theta记号  θ(g(n))\theta (g(n))={f(n):\{f(n):存在正常数c1,c2,n0,{c_1},{c_2},{n_0},使得对所有n≥n0,n \ge {n_0},有0≤c1g(n)≤f(n)≤c2g(n)}{\rm{0}} \le {c_1}g(n) \le f(n) \le {c_2}g(n)\} 。 
OO记号  O(g(n))O (g(n))]]></description><category></category></item><item><title><![CDATA[Chapter2 Getting Started]]></title><link>https://blog.youkuaiyun.com/paul777chen/article/details/44172339</link><guid>https://blog.youkuaiyun.com/paul777chen/article/details/44172339</guid><author>paul777chen</author><pubDate>Tue, 10 Mar 2015 12:55:18 +0800</pubDate><description><![CDATA[2.1 插入排序核心思想： 依次从未排序的数组中取出数，并将该数插入到有序数组中，并保持有序数组依然有序。（初始状态，有序数组仅一个数开始）—算法导论里给出的形象比喻：左手扑克牌已排好序，右手扑克牌未排序，从右手依次从左到右取出牌放入左手牌中并保证左手的拍依旧有序。 
C#代码（升序）：public void InsertSortUp(List<int> array)
{
    int key,]]></description><category></category></item></channel></rss>