I want to solve $T(n) = 2T(7n/10) + O (1)$ using the substitution method.
I think the solution should be $T(n) = O(n\log n)$, but I am having trouble constructing a proof by substitution.
Asked
Active
Viewed 102 times
0
-
3If you think it might be $n \log n$ you can go ahead and test that with the substitution method. What happens when you try that? You can add your work to original post and can help guide you more. – ryan Apr 06 '19 at 16:02
-
Have you read one or more answers in the search result? Have you read this one and this one? – John L. Apr 06 '19 at 16:45