A simple disk-scheduling system.
#include <iostream.h>
#include <math.h>
#include <time.h>
int rand(int&);
void clear(double [], int);
const int multip = 7919; // a prime number;
const int modulr = 7879; // a prime number;
main()
{
int fin = 100;
int i,j;
int n=10000;
int req[10000];
double moves[10000];
int seed = time(NULL)%1000;
for (int run=0; run <50; run++)
{
int start=0;
double movesum = 0.0;
double average = 0.0;
double variance = 0.0;
double vsum = 0.0;
clear(req,n);
clear(moves,n);
for (i=0; i<n; i++) // Generate n requests in req array
{
req[i]=rand(seed);
j=abs(req[i]-start);
moves[i]=double(j)/100.0;
