The big-o notation for an arbitrary switch case structure depends on the implementation details used in the lookup.

The only real answer for your question can be achieved by either defining the question more carefully or by writing a lookup using a given tool and then testing how it scales.

Both O(1) and O(N) can reasonably be argued for if no further constraints are given.