The time complexity of this recursion function
T(n) = 2T(n/2) + c for n > 1
I'm fairly sure this is O(lg n) but this video I'm watching has a guy saying it's O(n) which doesn't make sense to me. Which is right?
Submitted July 10, 2017 at 09:01PM by eatingpoopinrobarts
via reddit http://ift.tt/2sJRPuW