Solution (source code)

= Solution

<Shortest-seek-time-first disk scheduling> chooses the nearest remaining track after each service:
``
133 -> 135 -> 142 -> 157 -> 112 -> 97 -> 91 -> 76 -> 23
``
The distances are $2,7,15,45,15,6,15,53$, giving \b[158 tracks]. There are no distance ties along this service sequence.