Talk:Special Ordered Sets of Type N: Difference between revisions
Content added Content deleted
(Duplicate?) |
No edit summary |
||
| Line 2: | Line 2: | ||
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? --[[User:Mwn3d|Mwn3d]] 18:23, 25 January 2012 (UTC) |
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? --[[User:Mwn3d|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. |
|||
[[User:Nigel Galloway|Nigel Galloway]] 14:38, 26 January 2012 (UTC) |
|||
Revision as of 14:38, 26 January 2012
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)