Talk:Special Ordered Sets of Type N

From Rosetta Code
Revision as of 15:16, 26 January 2012 by rosettacode>Mwn3d (If it is a dupe then try to get the older, bigger one changed)

Duplicate?

After all the really complicated explanation that probably needs to be cleaned up if this is to become a task, it sounds a lot like Greatest subsequential sum. Is this a duplicate? Or at least too close to add value? --Mwn3d 18:23, 25 January 2012 (UTC)

I can see how you might think that. My title is much better of course, and has a wiki link.

Nigel Galloway 14:38, 26 January 2012 (UTC)

If it is the same idea then I would suggest trying to get the existing task changed rather than make a whole new one, since there are already a lot of examples there. If the other task needs more information then bring it up on its talk page. We can rename that task and add WP links easily, but we need to agree on the name and the task content. --Mwn3d 15:16, 26 January 2012 (UTC)
Retrieved from "https://rosettacode.org/wiki/Talk:Special_Ordered_Sets_of_Type_N?oldid=211785"