In the coding contest world, competitors think about 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 being the input size. I've added a few algorithms and data structure examples for each complexity class.

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

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