|Pathologically Eclectic Rubbish Lister|
Re^2: Challenge: Sorting Sums Of Sorted Seriesby Limbic~Region (Chancellor)
|on Feb 02, 2010 at 23:01 UTC||Need Help??|
Your code needs some TLC and your for (0 .. $#list) should probably be for (;;) loops. I had this idea too but felt it wasn't in the spirit of what ikegami intended (though it meets my criteria just fine).
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