LOOK (Disk Scheduling Disk Scheduling)

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$ words

(Needs sorted array of requests and seek distance but not much else)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1979

Reference

-