|
|
|
|
|
|
by Someone
5373 days ago
|
|
|
"Another good permutation problem, is subset sum problem. [...] Is it possible to get better than O(n^2) for the optimal solution." AFAIK subset sum is NP complete, so I guess you meant O(2^n). Even so, I would not expect a programmer to tell me much about it. |
|
|