[GNC-dev] Account > Auto-Clear

[John Ralls]

> On Oct 11, 2020, at 6:32 AM, Christopher Lam <christopher.lck at gmail.com> wrote:
> 
> 1) number of uncleared splits too high -- due to NP-hard problem, I find
> the limit around 20 uncleared splits

That's way too low a value--only 256K permutations--for it to be an NP Hard limitation. Far more likely it's down to a poorly selected algorithm; it's hard to imagine a worse choice than the provided brute-force combination of GLists and a GHashTable. https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/ has 3 better algorithms.

Regards,
John Ralls