Dear Mike,
Thank you for your hint!
On Mar 31, 1:04 pm, "Mike Hansen" <[EMAIL PROTECTED]> wrote:
<partially snipped>
> Here are the timings I get by pretty much just copying balanced_list_prod.
>
> sage: timeit('a=balanced_sum(L2,0)')
> 625 loops, best of 3: 12.6 µs per loop
>
> sage: timeit('a=balanced_sum(L3,0)')
> 625 loops, best of 3: 47.4 µs per loop
>
> sage: timeit('a=balanced_sum(L4,0)')
> 625 loops, best of 3: 469 µs per loop
>
> sage: timeit('a=balanced_sum(L5,0)')
> 125 loops, best of 3: 4.54 ms per loop
>
> sage: timeit('a=balanced_sum(L6,0)')
> 5 loops, best of 3: 54.5 ms per loop
So, this is much faster than sum, but it seems to me that it still
grows about linearly.
I remember having heard somewhere that summation of a list can be done
in logarithmic time.
But i am absolutely not sure if this is really true, and likely i am
mistaken.
Hence, sorry for my lack of "general computer science culture".
Yours
Simon
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
