Given the input set [400 402 521 735 758 191 191 307 679 776 877]
Is the algorithm supposed to weed out duplicates from its input?
In reply to Re^2: NP-complete sometimes isn't
by shmem
in thread NP-complete sometimes isn't
by tilly
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |