Messages in this thread |  | | Date | Tue, 19 Sep 2000 21:36:46 +0200 | From | Andrea Arcangeli <> | Subject | Re: An elevator algorithm (patch) |
| |
On Tue, Sep 19, 2000 at 08:30:05PM +0200, Peter Osterlund wrote: > It is however possible to decide in O(1) time if the correct insertion > point is at the end of the queue. We have to keep track of the point,
Right.
> [..] How long > can the request queue be? Does it have a fixed upper size, or is it
It have a fixed upper size (it's a #define).
> [..] Note that the worst case > complexity is still O(n) for all algorithms discussed so far.
Right.
Andrea - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org Please read the FAQ at http://www.tux.org/lkml/
|  |