I found the article on Computational Complexity: Section 2 very useful. While going through this article, I found a couple of points which looked incorrect to me.

1) In Example 7, the diagram of the recursion tree shows root node with value: cNlogN. Shouldn't it be cN as we have only theta(N)

2)In the same example there is this statement "Each of the levels has five times more vertices than the previous one, thus the last level has 5* log(n) levels.". It should be corrected to "Each of the levels has five times more vertices than the previous one, thus the last level has vertices or nodes."

ie the word levels has to be replaced by vertices/nodes.

Regards

Dilip]]>