SCAN (Disk Scheduling Disk Scheduling)

From Algorithm Wiki

Revision as of 08:44, 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

(https://www.geeksforgeeks.org/scan-elevator-disk-scheduling-algorithms/?ref=lbp)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1979

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=SCAN_(Disk_Scheduling_Disk_Scheduling)&oldid=47448"