I am trying to work out the recurrence relation for Ternary Search. This is what I came up with:
C(n) = C(n/3) + 2
However, I talked to my professor and he said it's not correct. He says that we need to take all of their cases into account. This part confuses me a little bit, can you please clear it for me?