View the step-by-step solution to:

Part 1 Design a greedy algorithm using pseudocode that solves this optimization problem of transferring files to disk while minimizing unused storage....

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) s1, ... snm the number of disks, and corresponding storages amounts t1, ..., tm. The algorithm should return an array map[i] which contains the disk index of which the ith 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.

Recently Asked Questions

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

-

Educational Resources
  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question