<?xml version="1.0" encoding="windows-1252"?>
<node id="20697" title="RE: RE: RE: sieve of erothenes" created="2000-06-30 23:52:33" updated="2005-07-19 14:08:39">
<type id="11">
note</type>
<author id="9135">
Adam</author>
<data>
<field name="doctext">
You win on the efficiency test too. with n = 100 we are roughly the same time, but as n gets large I get bogged down somewhere. I'm running a test with n = 1000000 on my dual proc, which has been hung for about five minutes now. But based on the out put I've already seen for smaller n's, I suspect that you will slaughter me time wise.&lt;p&gt; I don't understand why yours is faster because you use two for loops and I use a while loop the second time, dropping the overhead of making the temp array that foreach generates. Now I'm curious about the efficiencies of the two looping mechanisms...</field>
<field name="root_node">
20633</field>
<field name="parent_node">
20694</field>
</data>
</node>
