C-LOOK (Disk Scheduling Disk Scheduling)

From Algorithm Wiki
Revision as of 09:46, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$ words

(See LOOK)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1979

Reference

-