in reply to Re: Challenge: Sorting Sums Of Sorted Series
in thread Challenge: Sorting Sums Of Sorted Series
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
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: Challenge: Sorting Sums Of Sorted Series
by ikegami (Patriarch) on Feb 03, 2010 at 21:33 UTC | |
by Limbic~Region (Chancellor) on Feb 03, 2010 at 21:50 UTC | |
by ikegami (Patriarch) on Feb 03, 2010 at 22:18 UTC |