In the coding contest world competitors think of these tradeoffs all the time. No wonder, there's a set of numbers every algorithm designer should know.

The table below shows the limits that can be reached in a few seconds by algorithms of different complexities. n is the size of the input. I've added a few algorithms and data structure examples for respective complexity classes.

The table below shows the limits that can be reached in a few seconds by algorithms of different complexities. I've also added a few examples of algorithms or problems and data structures that may occur in those complexity classes.

|_. size of n |_. complexity |_. algorithms |_. data structures|
| 8 |  n^n^ | brute force, cartesian product |   |