<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Yuzhen_Feng的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Yuzhen_Feng</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Yuzhen_Feng]]></copyright><item><title><![CDATA[C++ Primer Plus 阅读笔记（一）：Dealing with Data]]></title><link>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/107342436</link><guid>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/107342436</guid><author>Yuzhen_Feng</author><pubDate>Tue, 14 Jul 2020 17:14:14 +0800</pubDate><description><![CDATA[〇、目录一、简单变量变量命名整型二、const 限定符三、浮点数浮点数类型浮点常量浮点数的优缺点四、C++算术运算符运算符优先级和结合性除法运算符类型转换初始化和赋值时进行的转换以{ }初始化时进行的转换（C++11）表达式中的转换传递参数时的转换强制类型转换C++11中的**auto**声明
一、简单变量
变量命名
在名称中只能使用字母、数字、下划线。
名称中第一个字符不能是数字。
不能用C++关键字作为名称。
以两个下划线或一个下划线和大写字母开头的名称被保留给实现（implementation）使用。]]></description><category></category></item><item><title><![CDATA[Notes of Reading Introduction to Algorithm —— Sorting in Linear Time]]></title><link>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/105895979</link><guid>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/105895979</guid><author>Yuzhen_Feng</author><pubDate>Sun, 03 May 2020 00:14:34 +0800</pubDate><description><![CDATA[Lower bound for comparison sorting
With the model of decision tree, we can work out that the lower bound for the worst case of comparison sorting is Ω(nlog⁡n)\Omega(n\log n)Ω(nlogn).
The decision tree...]]></description><category></category></item><item><title><![CDATA[Notes of Reading Introduction to Algorithm —— Quick Select]]></title><link>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/105679866</link><guid>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/105679866</guid><author>Yuzhen_Feng</author><pubDate>Wed, 22 Apr 2020 13:26:00 +0800</pubDate><description><![CDATA[There are all N elements in an array. When you are asked to get the kth greatest number, how will you do? There are several approaches:
First, you can sort the array, and then the index of the kth gre...]]></description><category></category></item><item><title><![CDATA[Notes of Reading Introduction to Algorithm —— Quicksort]]></title><link>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/105556501</link><guid>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/105556501</guid><author>Yuzhen_Feng</author><pubDate>Thu, 16 Apr 2020 17:23:41 +0800</pubDate><description><![CDATA[Just as Mergesort, Quicksort also applies Divide and Conquer. But in some cases, the time to call Quicksort can be Θ(n2)\Theta (n^2)Θ(n2), just like Insertionsort, which is different from Mergesort. I...]]></description><category></category></item><item><title><![CDATA[Notes of Reading Introduction to Algorithm —— Heapsort]]></title><link>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/105505821</link><guid>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/105505821</guid><author>Yuzhen_Feng</author><pubDate>Tue, 14 Apr 2020 14:01:19 +0800</pubDate><description><![CDATA[Heaps
A binary heap can be stored in an array.
If we know the index of a node, we can easily work out the indices of its parent, left child and right child. Therefore, we have the three functions to g...]]></description><category></category></item><item><title><![CDATA[Notes of Divide and Conquer —— Question of Closest Pair]]></title><link>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/105498061</link><guid>https://blog.youkuaiyun.com/Yuzhen_Feng/article/details/105498061</guid><author>Yuzhen_Feng</author><pubDate>Mon, 13 Apr 2020 22:20:18 +0800</pubDate><description><![CDATA[This is the notes of my course —— Data Structure, lectured by Prof. Zhe Liang, Tongji University.
There are a lot of points on the paper, and you know the address of every point. You should try to fin...]]></description><category></category></item></channel></rss>