{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/91d2e9b696f0462d9bbe01c8a075f97d\" frameborder=\"0\" width=\"1908\" height=\"1431\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":1431,"width":1908,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":1431,"thumbnail_width":1908,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/91d2e9b696f0462d9bbe01c8a075f97d-9a7aa2924f389edd.gif","duration":7086.292,"title":"9FM0 D1 2025 Paper","description":"This Loom explains how to use the first fit bin packing algorithm to pack a given list of numbers into bins of size 13. It demonstrates placing numbers sequentially into the first bin where each item fits, tracking remaining space as it forms multiple bins and reaches totals such as 11.3 with 1.7 left, and 3.8 with 9.2 left. It then switches to first fit decreasing, sorting the same values by size and repacking into bins, emphasizing the need to restart from the top each time to avoid mistakes. The speaker also notes the process is worth five marks and can be easy to lose marks early in a time pressured exam."}