Code plus a detailed analysis of each part.

The multimedia/mobile company you work for is currently attempting to transfer large media files from older disks to newer disks (on various servers). The task of simply copying over all of these files in any haphazard order is fairly straightforward; however, you believe that you can improve upon a haphazard approach and hope to improve the efficiency of storage space on the new disks. You have a collection of m disks, but you believe that if you smartly organize the media files onto the disks, you may not need to use all m disks.

You plan to design a greedy algorithm to efficiently transfer media to storage devices. Note that this is an optimization problem. Optimization problems have a general structure and consist of some quantity to be maximized or minimized under some list of constraints. In this problem, you have n files (f₁, ..., f_n) with corresponding sizes (in MBs) s₁, ... s_n. Your goal is to store these files onto m disks, d₁, ..., d_m, that have corresponding storages amounts t₁, ..., t_m. Note that one file cannot be spread across multiple disks. In this problem, the goal is to minimize the amount of storage that is not used on each disk (that is used). This should also minimize the total number of number of disks being used. That is, you would like to fill up each disk as much as possible while leaving a minimally small amount of unused storage. (In the perfect case, each disk would be perfectly filled, and there would be no unused storage.) If there are any disks left unused, you will be able to return them for a refund.

Assignment

Part 1

• Design a greedy algorithm using pseudocode that solves this optimization problem of transferring files to disk while minimizing unused storage. The inputs to this algorithm are the number of files n, corresponding sizes (in MBs) s₁, ... s_n, m the number of disks, and corresponding storages amounts t₁, ..., t_m. The algorithm should return an array map[i] which contains the disk index of which the i^th media file should be stored.
• Comment your pseudocode for increased readability.

Part 2

• Discuss the optimality of your algorithm. Is it guaranteed to return an optimal result?
• What is the Big-O time complexity of this algorithm in terms of m and n? Justify your answer.

Part 3

• If you were to solve this problem using a brute force or exhaustive search method, what would be the time complexity? Justify your response.