Timeline for Code for calculating best possible combination in an array
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 21, 2016 at 18:13 | comment | added | miscco | Yeah, i wrote it in the editor, feel free to edit. The quadratic runtime is due to the requirement that the longest segment has to be taken and cannot be optimized any further. Even if you start with the longest sequences, you can only stop at 0 | |
| Oct 21, 2016 at 11:24 | comment | added | hellozee | that is almost like my approach , and probably quadratic , also your code is full of typos (how ironical is this) , thanks for taking a look at it | |
| Oct 21, 2016 at 9:11 | history | answered | miscco | CC BY-SA 3.0 |