In article <slr### [at] tealhhjpat> , 
hjp### [at] SiKituwsracat (Peter J. Holzer) wrote:

>>Total:               O(n * log(n) + n * log(n))
>
> which is O(n * log(n)
>
>>Total:               O(2 * n + n * log(n))
>
> which is also O(n * log(n)
>
> No difference there.

Yes, because I was lazy and just did a copy and paste.  In big-O notation
this will be the result, but this is not the whole issue (just eliminate the
big-O in the total!).

> Which one of the two algorithms is really faster depends on the
> implementation and the input data.

No, it is a clear which one is faster, just my notation for the total was
incorrect:  See my later posts explaining it in more detail.


      Thorsten


____________________________________________________
Thorsten Froehlich, Duisburg, Germany
e-mail: tho### [at] trfde

Visit POV-Ray on the web: http://mac.povray.org

Post a reply to this message