Nu exista diferente intre titluri.
Diferente intre continut:
|_. maximum n |_. complexity |_. algorithms |_. data structures|
| 8 | n^n^ | brute force, cartesian product | |
| 9-10 | n! | brute force, backtracking, next_permutation | |
| 11 | n! | brute force, backtracking, next_permutation | |
| 13-17 | 3^n^ | dynamic programming with exponential states | hash_map (to store the states) |
| 15 - 20 | n^2^ 2^n^ | dynamic programming with exponential states | bitsets, hash_map |
| 15 - 25 | 2^n^ | subset enumeration, brute force, dynamic programming with exponential states | |
| 15 - 24 | 2^n^ | subset enumeration, brute force, dynamic programming with exponential states | |
| 25 - 40 | 3^n/2^, 2^n/2^ | 'meet in the middle':blog/meet-in-the-middle | hash tables (for set intersection) |
| 30-50 | n^4^, n^5^, n^6^ | | |
| 300-500 | n^3^ | all pairs shortest paths, largest sum submatrix, matrix multiplication, matrix chain multiplication, network flow | |
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
