View various disk scheduling algorithms

Suppose we have a queue: 98 183 37 122 14 124 65 67
Suppose we start at position 53

FCFS scheduling (first-come-first-served scheduling)
Therefore, the scheduling sequence is:
98 183 37 122 14 124 65 67

SSTF scheduling (shortest search time priority scheduling)
This means that the cyclist has the shortest distance between the current cylinders, and the target cylinder will be dispatched first.
So we get the sequence:
65 67 37 14 98 122 124 183

Scan schedule
The algorithm is used like an evaluator that reaches the last direction first. Then it came back from the beginning like an escape.
If we initially set the direction to 0, we get the following sequence:
53 37 14 65 67 98 122 124 183
C-SCAN scheduling
This is an extension of the SCAN algorithm. When the end of the number of cylinders is reached, we will not change direction. We just go to the 0 position and redo the plan until everything is done. It's like a circle.
Assuming our direction is from 0 to the end, then we get the sequence:
65 67 98 122 124 183 14 37

LOOK / C-LOOK scheduling
These two algorithms are like SCAN / C-SCAN, but we do not return to the end and start positions, we just run like erasers / circles between the targets that need to be reached.
The sequence is like SCAN / C-SCAN, but the maximum range we did not reach 0 and 199.