Description: Greedy algorithm for solving the report of operations (including certificate) and the source code: the optimal disk file storage issues, had spent some time to prove. Problem Description: There are n disk-based files, f1, f2, ..., fn,, accounts for each file on a disk track. This n the probability of a document retrieval are p1, p2, ..., pn,
And Σpi = 1. Head from the current track information to be seized can be used track the time required between these two tracks to measure the radial distance. Pi if the file stored in the first track i,, then retrieve documents that the expectations of n is Σpipjd (i, j)
Which d (i, j) is the first i Road with the first j of the radial distance between the Road | ij |. Optimal storage disk file to seek to establish that n files on the disk storage location, so expect to minimize search time. Try to design a solution algorithm for this problem and to analyze the correctness of algorithms and computational complexity.
To Search:
- [disk] - document optimal disk storage, disk base
File list (Check if you may need any files):
disk
....\disk.cpp
....\disk.pdf
....\disk.ppt