Introduction to Algorithm
Notes of books, Introduction to Algorithm...
Yuzhen_Feng
这个作者很懒,什么都没留下…
展开
-
Notes of Reading Introduction to Algorithm —— Sorting in Linear Time
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 Ω(nlogn)\Omega(n\log n)Ω(nlogn). The decision tree...原创 2020-05-03 00:14:34 · 226 阅读 · 0 评论 -
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 · 198 阅读 · 0 评论 -
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 · 205 阅读 · 0 评论 -
Notes of Reading Introduction to Algorithm —— Heapsort
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...原创 2020-04-14 14:01:19 · 273 阅读 · 0 评论