Question on Binary Search

kaymin

Senior member
Jul 21, 2001
646
0
0
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!