-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcscan_disk.c
64 lines (56 loc) · 1.44 KB
/
cscan_disk.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <stdio.h>
#include <stdlib.h>
int size = 8;
void CSCAN(int arr[], int head) {
int seek_count = 0;
int distance, cur_track;
int left = 0, right = size - 1;
int visited[size];
for (int i = 0; i < size; i++) {
visited[i] = 0;
}
printf("Seek Sequence is\n");
for (int i = 0; i < size; i++) {
for (int j = i + 1; j < size; j++) {
if (arr[i] > arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
for (int i = 0; i < size; i++) {
if (arr[i] > head) {
left = i - 1;
right = i;
break;
}
}
for (int i = right; i < size; i++) {
cur_track = arr[i];
if (!visited[i]) {
distance = abs(cur_track - head);
seek_count += distance;
head = cur_track;
visited[i] = 1;
printf("%d\n", cur_track);
}
}
for (int i = left; i >= 0; i--) {
cur_track = arr[i];
if (!visited[i]) {
distance = abs(cur_track - head);
seek_count += distance;
head = cur_track;
visited[i] = 1;
printf("%d\n", cur_track);
}
}
printf("Total number of seek operations: %d\n", seek_count);
}
int main() {
int arr[8] = { 176, 79, 34, 60, 92, 11, 41, 114 };
int head = 50;
CSCAN(arr, head);
return 0;
}