[Home] [Groups] - Message: [Prev in Group] [Next in Group]
12396: Re: [MUD-Dev] Event Scheduling
[Full Header] [Plain Text]
From: Ola Fosheim Grøstad <olag@ifi.uio.no>
Newsgroups: nu.kanga.list.mud-dev
Date: Tue, 08 Feb 2000 20:50:30 +0100
References: [1]
Organization: Kanga.Nu
Hans-Henrik Staerfeldt wrote:
> I once saw a lecture covering an eventqueue algorithm running O(log(log(n)))
> for insertions and O(1) for deletions. My guess would be that it is the
> implementation of the actual events that will take the time, even if you
> use a O(log(n)) time event queue, or are my notions wrong?
That seems to depend on n? :*) Anyway, I don't think big Oh-notation is
the most useful here. I think you can do rather well with a bucket sort
approach. At least if most insertions do not end up in the "current"
bucket.
Ola.
_______________________________________________
MUD-Dev maillist - MUD-Dev@kanga.nu
http://www.kanga.nu/lists/listinfo/mud-dev