Anonymous user
Talk:Greatest subsequential sum: Difference between revisions
added a header for the first topic so the table-of-contents shows up before the topic headers.
(added a header for the first topic so the table-of-contents shows up before the topic headers.) |
|||
| (One intermediate revision by one other user not shown) | |||
Line 1:
== what is the task?==
Currently this contains some ruby code, and no clear description of exactly what the task is. Please clarify the exact goal so others can provide implementations for the languages they use. --- [[User:crc|crc]] 2007-06-21
Line 26 ⟶ 27:
:I've fixed the bug in Python version [functions maxsumseq() and maxsumit()] - [[User:A|a__]] 17:17, 28 March 2011 (UTC)
==Open question==
Take n random sequences, each of 1000 random numbers in [-1000 .. 1000].
Take the mean M<sub>n</sub> of their best score ( sum of values of max sub-sequence / n). Is there a limit for M<sub>n</sub> when n → ∞ ? Experiments show something around 22000, but a formal proof will be great !
--[[User:G.Brougnard|G.Brougnard]] ([[User talk:G.Brougnard|talk]]) 17:55, 20 September 2015 (UTC)
| |||