- 博客(6)
- 收藏
- 关注
RSS订阅原创 C++ Primer Plus 阅读笔记（一）：Dealing with Data
〇、目录一、简单变量变量命名整型二、const 限定符三、浮点数浮点数类型浮点常量浮点数的优缺点四、C++算术运算符运算符优先级和结合性除法运算符类型转换初始化和赋值时进行的转换以{ }初始化时进行的转换（C++11）表达式中的转换传递参数时的转换强制类型转换C++11中的**auto**声明一、简单变量变量命名在名称中只能使用字母、数字、下划线。名称中第一个字符不能是数字。不能用C++关键字作为名称。以两个下划线或一个下划线和大写字母开头的名称被保留给实现（implementation）使用。
2020-07-14 17:14:14
1034
原创 Notes of Reading Introduction to Algorithm —— Sorting in Linear Time
Lower bound for comparison sortingWith the model of decision tree, we can work out that the lower bound for the worst case of comparison sorting is Ω(nlogn)\Omega(n\log n)Ω(nlogn).The decision tree...
2020-05-03 00:14:34
235
原创 Notes of Reading Introduction to Algorithm —— Quick Select
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...
2020-04-22 13:26:00
204
原创 Notes of Reading Introduction to Algorithm —— Quicksort
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...
2020-04-16 17:23:41
216
原创 Notes of Reading Introduction to Algorithm —— Heapsort
HeapsA 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...
2020-04-14 14:01:19
282
原创 Notes of Divide and Conquer —— Question of Closest Pair
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...
2020-04-13 22:20:18
158
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人