Nu exista diferente intre titluri.
Diferente intre continut:
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.
|_. maximum n for a few seconds execution time |_. complexity |_. algorithms |_. data structures|
|_. maximum n for a second execution time |_. complexity |_. algorithms |_. data structures|
| 8 | n^n^ | brute force, cartesian product | |
| 9-10 | n! | brute force, backtracking, next_permutation | |
| 13-17 | 3^n^ | dynamic programming with exponential states | hash_map (to store the states) |
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
