If Bin. Search uses log2 n algorithm time, then does that mean ternary search uses log 3n time? Which make them about the same speed because the base of the logarithm doesn't matter in algorithmic time? Thanks!
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.