[Edu-sig] Analyzing algorithms...

Kirby Urner urnerk@qwest.net
Mon, 25 Feb 2002 10:03:37 -0800


At 06:21 PM 2/25/2002 +0100, Gregor Lingl wrote:
>In my opinion it is not feasible to
>measure or even estimate the runtime-
>behaviour of those algorithms from the demos.

Yeah, that sounds reasonable.  The point of the
animations is to give some idea of how they work,
not which is ultimately fastest.  A caveat to
share with students if using them in a classroom
setting.

Kirby