On Fri, 08 Sep 2000 13:36:17 -0500, Thorsten Froehlich 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.

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

	hp

-- 
   _  | Peter J. Holzer    | Nicht an Tueren mangelt es,
|_|_) | Sysadmin WSR       | sondern an der Einrichtung (aka Content).
| |   | hjp### [at] wsracat      |    -- Ale### [at] univieacat
__/   | http://www.hjp.at/ |       zum Thema Portale in at.linux

Post a reply to this message