Emails us- Call US

Assignment help 1150

The library has n books that must be stored in alphabetical order on adjustableheight shelves. Each book has a height and a thickness. The width of the shelf is fixed at w,and the sum of the thicknesses of books on a single shelf cannot exceed w. The next shelfwill be placed on top, at a height equal to the maximum height of a book on the shelf.Give an efficient algorithm that minimizes the total height of shelves used to store all thebooks. You are given the list of books in alphabetical order, bi = (hi, ti), where hiis theheight and tiis the thickness, and the shelf width w.

Need the algorithm and proof of correctness


15% off for this assignment.

Our Prices Start at $11.99. As Our First Client, Use Coupon Code GET15 to claim 15% Discount This Month!!

Why US?

100% Confidentiality

Information about customers is confidential and never disclosed to third parties.

Timely Delivery

No missed deadlines – 97% of assignments are completed in time.

Original Writing

We complete all papers from scratch. You can get a plagiarism report.

Money Back

If you are convinced that our writer has not followed your requirements, feel free to ask for a refund.