Simulate the following disk scheduling algorithms FCFS

  #include<stdio.h> 

#include<conio.h> 
void main() 
{ 
 int n,i,queue[30],head,diff,seek=0; 
 printf("enter number of queue elements : "); 
 scanf("%d",&n); 
 printf("enter the work queue : "); 
 for(i=0;i<n;i++) 
 scanf("%d",&queue[i]); 
 printf("enter the disk head starting position : "); 
 scanf("%d",&head); 
 for(i=0;i<n;i++) 
 { 
 diff=abs(head-queue[i]); 
 seek=seek+diff; 
 head=queue[i]; 
 } 
 printf("total seek time : %d\n",seek); 
}