SSTF (Disk Scheduling Disk Scheduling): Difference between revisions
Jump to navigation
Jump to search
(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 == -") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n | $O(n \log n)$ with binary tree | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$ words | ||
(https://www.geeksforgeeks.org/program-for-sstf-disk-scheduling-algorithm/?ref=lbp) | (https://www.geeksforgeeks.org/program-for-sstf-disk-scheduling-algorithm/?ref=lbp) | ||
Latest revision as of 08:44, 10 April 2023
Time Complexity
$O(n \log n)$ with binary tree
Space Complexity
$O(n)$ 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
-