in reply to Re^7: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable))
in thread Divide an array into 2 subsets to verify their sum is equal or not.

> Again, if you could've maintained your attention span for the whole 45-50 seconds it would've taken you to read the entire post, you'd realise that all you doing it repeating what *I said* in my post.

Apparently clearer and with less words.

I tried to read it again and gave up.

> > Well, bad trained personnel!

> You'd know. YOU are one of them.

hdb was pretty clear that you would win this contest, if your algorithm did what you are claimingı it does.

You denied it.

I don't enjoy discussing with your propaganda machine, but from a logical POV thats plain wrong!

Somebody needed to say it, no matter how many insults your piling on people with other opinions.

plonk

Cheers Rolf

( addicted to the Perl Programming Language)

1) "This will very quickly (less than 0.001 of a second) find a solution, if one exists, for sets of 100s or 1000s of elements."

  • Comment on Re^8: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable))

Replies are listed 'Best First'.
Re^9: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable))
by BrowserUk (Patriarch) on May 03, 2013 at 23:22 UTC
    Plonk

    I knew it; you're a plonker.

    With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
    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]
      Enjoy your million! =)

      Cheers Rolf

      ( addicted to the Perl Programming Language)

[reply]

        Enjoy your last word.

[reply]

In Section Seekers of Perl Wisdom