Message Boards Message Boards


Finding the complexity of a recursive function

Posted 5 months ago
1 Reply
1 Total Likes

First time user here.

I'm trying to use Wolfram|Alpha to calculate the time complexity of a recursion function. When using the calculator, the results I get don't include terms such as bigO Omega etc.

For this function: I should get θ(n), but I can't find it.

Your help is much appreciated.

Why do you expect W|A to give a big-O form for the result? (It is not obvious to me that this shouldn't happen, but neither is it obvious that it should.)

Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
or Discard

Group Abstract Group Abstract