Is there an online tool that returns the time complexity of recursion functions?
For instance when I enter : T(n) = T(n/2) +n I'd like to get: θ(n)
I tried using wolframalpha but it doesn't return the above result I was looking for.
https://www.wolframalpha.com/input/?i=g%28n%29%3Dg%28n%2F2%29%2Bn
I found it. One needs to click on "Show Weaker Bound" button. See attached