I was working on recurrence relation and came across this example
T(n) = 2T(n/2) + log(n)
What will be the time complexity, ie, big O for this relation.
Thanks for any help in advance.
Asked
Active
Viewed 33 times
0
-
Are you getting stuck on something? – Isaac Kleinman Mar 04 '14 at 02:51
-
I worked it out more than a couple of times. I was getting O(nlog(n)). But some of my colleagues answer are conflicting with me as they are getting O(n). – Mcolorz Mar 04 '14 at 02:56
-
1Hint: they are right ;-) why don't you show your work so that you can be corrected. – Isaac Kleinman Mar 04 '14 at 02:57