in reply to Re: NP-complete sometimes isn't
in thread NP-complete sometimes isn't

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?

Replies are listed 'Best First'.
Re^3: NP-complete sometimes isn't
by BrowserUk (Patriarch) on Sep 02, 2008 at 10:13 UTC

    No. I produce the "input list" shown in my post, by combining the partitions output from tilly's code. (Because it wasn't actually displayed anywhere.)

    But, as tilly explained, under certain circumstances, the OP code he posted contained a bug that meant it would duplicate one value. He quickly corrected that problem, but not before I downloaded and ran his code.

    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority".
    In the absence of evidence, opinion is indistinguishable from prejudice.
[reply]

In Section Meditations