# Finding the complexity of a recursive function

Posted 27 days ago
247 Views
|
|
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: 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.