Timeline for A partition algorithm for positive integers
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5, 2015 at 8:29 | comment | added | Jarod42 | @Jason: Solution updated. | |
| Mar 5, 2015 at 8:27 | history | edited | Jarod42 | CC BY-SA 3.0 |
Rework solution.
|
| Mar 3, 2015 at 20:39 | comment | added | user65079 | Any update yet? | |
| Feb 27, 2015 at 18:01 | comment | added | Jarod42 |
@Jason: You have right, my algorithm is wrong :-( I will think if there is a fix which is still in O(n), else there is a solution in O(n log(n))...
|
|
| Feb 27, 2015 at 17:17 | comment | added | user65079 | Something is wrong: in {5, 6, 1, 4, 9, 3, 1, 2} it outputs 14, whereas the correct is 13: { {5, 6, 1}, {4, 9}, {3, 1, 2} }... | |
| Feb 27, 2015 at 16:37 | comment | added | user65079 | Great! Thank you very much!!! However, the algorithm looks quite simple... Are you sure it doesn't miss any case? Do you have any "hints" of a possible proof? | |
| Feb 27, 2015 at 15:40 | comment | added | user65079 | Can you rewrite it for older C++ versions (no auto variables, etc.)? It seems quite a bit complicated and arrays are better in time complexity than vectors, I think... | |
| Feb 27, 2015 at 15:37 | vote | accept | CommunityBot | ||
| Feb 16, 2015 at 18:26 | history | answered | Jarod42 | CC BY-SA 3.0 |