TIME COMPLEXITY

Best Case time

• $k = 1, x = L[1],$ best-case input.
• $B(n) = 1$, as a function of input size.

Worst Case time

• $x = L(n)$ or $x \not \in L$
• $W(n) = n$