Message Boards Message Boards

0
|
8671 Views
|
1 Reply
|
1 Total Likes
View groups...
Share
Share this post:

Finding the complexity of a recursive function

Posted 3 years ago

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: https://www.wolframalpha.com/input/?i=g%28n%29%3Dg%28n%2F2%29%2Bn I should get θ(n), but I can't find it.

Your help is much appreciated.

POSTED BY: univ bl

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.)

POSTED BY: Daniel Lichtblau
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract