The best solution I have (memory/time) is 4N + M but the most memory efficient while still having a reasonable run time is 2N + M.
Cheers - L~R
In reply to Re^2: Challenge: Sorting Sums Of Sorted Series
by Limbic~Region
in thread Challenge: Sorting Sums Of Sorted Series
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |