CLRS (Introduction to Algorithms 2nd) reanding notes 3

最新推荐文章于 2013-08-28 08:04:00 发布

原创最新推荐文章于 2013-08-28 08:04:00 发布 · 590 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#recursion #structure #tree #basic

Basics & Theories 专栏收录该内容

46 篇文章

订阅专栏

本文探讨了数据结构与算法的高级主题，包括B-树、二项堆、斐波那契堆等复杂数据结构的分析及应用。通过数学证明和技术细节深入研究了这些结构的效率，介绍了计算理论中的一些有趣技巧。

Just finished Part 5. It's getting harder but more interesting.

First, in part 5 'amortized analysis' methodology (from Part 4) has been widely adopted serving as the basic tool for Part 5 algorithms complexity analysis.

Chapter 18 is B-Tree which is a generalized tree structure; Chapter 19 is 'Binomial Heap' which is essentially a recursive structure so many algorithms complexity analysis work adopts recursion methodology. In my opinion 'Binomial Heap' is a quite elegant structure because it complies with Recursion perfectly; Chapter 20 'Fibonacci Heap' is the most difficult part in this part - the maths here is much more complex.. Chapter 21 is about set algorithms. The most difficult point here is still the maths for proof of the complexity. Some quite interesting techniques from Computation Theory is introduced here... tough, but really fun.

Just like R-B Tree, I need some time to review the whole stuff for Part 4 & 5.