Also, try compiling bob and rcs. For a 20,000 member list, bob is
about 1,500 times faster than rcs, by the way.
(%i31) bob(p);
Evaluation took 0.0200 seconds (0.0200 elapsed)
(%o31) 1
(%i33) rcs(p);
Evaluation took 30.2200 seconds (30.2200 elapsed)
(%o33) 1
Barton
-----maxima-bounces at math.utexas.edu wrote: -----
>On?Wed,?May?13,?2009?at?3:41?PM,?Oliver?Kullmann
><O.Kullmann at swansea.ac.uk>?wrote:
>>?It's?really?the?opposite:?Loops?are?*much*?slower!
>
>Try?compiling?the?loop?form?(with?declarations).??You?are?comparing?an
>interpreted?for-loop?with?a?compiled?loop?(create_list?and?+?are
>compiled?code).
>
>Also,?it?is?better?practice?to?use?xreduce?than?to?use?apply?for
>things?like?this.
>
>??????????????-s
>