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

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

No, it does not depend on the input data too much.  The reason being that
the tree used for the map will be balanced so you should always have about
log n access time.  And for the merge sort it also does not matter, it will
always take n log n time.

I fell for the trap of the big-O notation at first, too, when replying to
Ron, but I was simply implying the wrong thing at first by using big-O
notation for the totals, especially because you can't compare big-Os of
functions anyway ...


      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