melissak
asked on
ternary search algorithm
What is the worst case time complexity in big-oh notation for a ternary search algorithm? I think it is log base3 of N but I can't find any of my old text books to verify. Please respond. Thanks.
ozo
O(log base3 of N) = O(log base2 of N)
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
ASKER
impressive!