Let's say I found  a 2-approximation algorithm for a certain problem and I want to show that the analysis is tight. Do I now need to come up with an example of generic size $n$ or does it suffice to show that I   have an example of size $10$ for which the algorithm yields $2OPT$?
Providing Tight Example in Approximation Algorithm Analysis
algorithms;proof techniques;approximation