要求：



1。实现三种算法：



1。先来先服务



2。最短寻道优先（老师会给当前磁头的位置）



3。电梯算法



2。磁道服务顺序从指定的文本文件（TXT文件）中取出



3。输出：



第一行：磁道的服务顺序



第二行：显示移动总道数-Requirements: 1. The realization of the three algorithms: 1. First Come First Served 2. Shortest seek priority (the teacher will give the current head position) 3. Elevator Algorithm 2. Track service order from the specified text file (TXT files) out of 3. Output: the first line: Track service order of the second line: Road show that the total number of mobile