The stupid question is the question not asked | |
PerlMonks |
Re: Challenge: Sorting Sums Of Sorted Seriesby Krambambuli (Curate) |
on Feb 03, 2010 at 08:12 UTC ( [id://821097]=note: print w/replies, xml ) | Need Help?? |
Can't help, have to ask this question: how would an algorithm that would deal with this problem for infinite (huge...) lists look like...? Update: And, given a finite part of each serie, a1, ..., aN, b1, ..., bM, how many - which - terms of the result could be trustfully computed (knowing that there are other terms to follow) ? And how far could we advance with the 'arrival' of aN+1 and/or bM+1...? hmmmm... Is someone aware of some good readings in order to get the answers ? Thanks, Krambambuli ---
In Section
Seekers of Perl Wisdom
|
|