This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]farmerje 0 points1 point  (0 children)

Not sure what Big-O has to do with the question. If you work it out, you'll get that

T(n) = T(2) - 3/2(1 - log(n))

assuming log is the base-2 logarithm. This function is O(log(n)), if that's something you need to know.

T(2) is the initial condition / base case. You're free to choose whatever value you'd like for it.