review various Disk scheduling algorithms

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

FCFS scheduling(first come first serve scheduling)
so,the scheduling sequence is:
98 183 37 122 14 124 65 67

SSTF scheduling(shortest seek time first schduling)
this means that the cyclinder has shortest distance between current cylinder and the aim cylinder will be scheduled first.
so, we get the sequence:
65 67 37 14 98 122 124 183

SCAN scheduling
this algorithm uses like an evalator that first go to a direction until reach the end. then, it come back like an evalator from end to start.
if we initially make the direction to 0, we get the sequence:
53 37 14 65 67 98 122 124 183
C-SCAN scheduling
this is extension of SCAN algorithm. we are not change the direction when we got the end of the cylinder number. we just go to the 0 position and redo the schedule until we finish all the operation. this is like a circle.
suppose our direction is from 0 to end,so we get the sequence:
65 67 98 122 124 183 14 37

LOOK/C-LOOK scheduling
this two algorithm just like SCAN/C-SCAN but we don't get back to the end and start position, we just run like a elavator/circle between what we need reach.
the sequence is just like SCAN/C-SCAN, but we don't reach 0 and 199 in max range.