|Perl Monk, Perl Meditation|
Re^8: Divide an array into 2 subsets to verify their sum is equal or not. (NP != unsolvable))by LanX (Bishop)
|on May 03, 2013 at 23:18 UTC||Need Help??|
> 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.
( addicted to the Perl Programming Language)