#include<stdio.h>
#include<stdlib.h>
#include<time.h>
int *Init(int arr[])
{
	int i = 0;
	
	srand((unsigned int)time(0));
	for (i = 0; i < 15; i++)
	{
		arr[i] = rand() % 200 + 1;
		printf("%d ", arr[i]);
	}
	printf("\n");
	return arr;
}

void two_part(int arr[])
{
	int i = 0;
	int j = 0;
	int k = 0;
	int sum = 0;
	int a[15];
	int b[15];
	int num = 100;      //当前磁头在100号磁道上
	a[0] = 100;
	b[0] = 100;
	for (i = 0; i < 15; i++)
	{
		for (j = 1; j < 15 - i; j++)
		{
			if (arr[j] < arr[j - 1])
			{
				int tmp = arr[j];
				arr[j] = arr[j - 1];
				arr[j - 1] = tmp;
			}
		}
	}
	i = 0;
	j = 0;
	for (i = 0; i < 15; i++)
	{
		if (arr[i] >= num)
		{
			a[j+1] = arr[i];
			j++;
		}
		else
		{
			b[k+1] = arr[i];
			k++;
		}
	}
	printf("访问序列:\n");
	for (i = 1; i <= j; i++)
	{
		printf("%d ", a[i]);
	}
	for (i = k; i >0; i--)
	{
		printf("%d ", b[i]);
	}
	sum = ((a[j]-100)*2+(100- b[1]))/15;
	printf("平均寻道长度:%d", sum);
}

int main()
{
	int arr[15] = { 0 };
	int *ret=Init(arr); 
	two_part(ret);
	getchar();
	return 0;
}


版权声明:本文为pointer_y原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。
原文链接:https://blog.csdn.net/pointer_y/article/details/52402121