Big-Theta( log(base 3) n )

[ Follow Ups ] [ Post Followup ] [ CS2604 Discussion WWWBoard ] [ FAQ ]

Posted by Michael Ashwell on July 29, 1999 at 19:51:22:

Would you ever see a time complexity of
Big-Theta( log(base 3) n )

I would think not, since
log(base 3) n = 0.630929754571 * log(base 2) n
just a constant

It seems like it should still be
Big-Theta( log(base 2) n )

Is this correct?

Thanks,
Michael


Follow Ups:


Post a Followup

Name:
E-Mail:

Subject:

Comments:

Optional Link URL:
Link Title:
Optional Image URL:

[ Follow Ups ] [ Post Followup ] [ CS2604 Discussion WWWBoard ] [ FAQ ]