Date: 01 Dec 2012 17:22
Number of posts: 3
RSS: New posts
The O(). No need for the exact function.
I'm afraid there was some confusion with HW3 versions, and an incorrect version of Q4b took over…
But even the O() is pretty complex… as it depends on the depth of the recursion tree. there is no simple way to describe the final level of the tree, which determines, in my opinion, the O().
are we misunderstanding the question?