shortest seek time first added

Author: hardikrana11

LAB-8/sstf.cpp

@@ -0,0 +1,82 @@
+#include<bits/stdc++.h>
+
+struct di
+{
+int num;
+int flag;  //process is taken or not
+};
+
+int main()
+{
+ int i,j,sum=0,n,min1,loc,x,y;
+ //struct disk d[20];
+ int disk;
+ //int ar[20],a[20];
+
+ printf("enter number of location\n");
+ scanf("%d",&n);
+
+ struct di d[n];
+ int ar[n],a[n];
+
+ printf("enter position of head\n");
+ scanf("%d",&disk);
+
+ printf("enter elements of disk queue\n");
+ for(i=0;i<n;i++)
+ {
+  scanf("%d",&d[i].num);
+  d[i].flag=0;
+ }
+
+ for(i=0;i<n;i++)
+ {
+   x=0; min1=0;loc=0;
+   for(j=0;j<n;j++)
+   {
+     if(d[j].flag==0)
+     {
+      if(x==0)
+      {
+       ar[j]=disk-d[j].num;
+       if(ar[j]<0)
+       {
+         ar[j]=d[j].num-disk;
+       }
+       min1=ar[j];
+       loc=j;
+       x++;
+      }
+     else
+     {
+       ar[j]=disk-d[j].num;
+       if(ar[j]<0)
+       {
+        ar[j]=d[j].num-disk;
+       }
+     }
+     if(min1>ar[j])
+      {
+         min1=ar[j];
+         loc=j;
+      }
+     }
+    }
+    d[loc].flag=1;
+    a[i]=d[loc].num-disk;
+    if(a[i]<0)
+    {
+     a[i]=disk-d[loc].num;
+    }
+
+     disk=d[loc].num;
+ }
+
+
+ for(i=0;i<n;i++)
+ {
+ sum=sum+a[i];
+ }
+ printf("\nmovement of total cylinders %d",sum);
+ return 0;
+}