SSTF (Disk Scheduling Disk Scheduling)

From Algorithm Wiki
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n*log n)$ with binary tree == Space Complexity == $O(n)$ auxiliary words (https://www.geeksforgeeks.org/program-for-sstf-disk-scheduling-algorithm/?ref=lbp) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1979 == Reference == -")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n*log n)$ with binary tree

Space Complexity

$O(n)$ auxiliary words

(https://www.geeksforgeeks.org/program-for-sstf-disk-scheduling-algorithm/?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=SSTF_(Disk_Scheduling_Disk_Scheduling)&oldid=44868"