GitHub - MalakM15/Bin-Packing-Problem-Solution-Using-MIPS-Assembly-: implementing a Bin Packing Solver using MIPS assembly language. The goal is to pack a list of items into the minimum number of bins using two heuristic approaches: First Fit (FF) and Best Fit (BF). Bin packing problem: Given a collection of items in a file.with corresponding sizes. The size of each item is a floating-point number between 0 and 1

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
mipsfinal.asm		mipsfinal.asm

About

implementing a Bin Packing Solver using MIPS assembly language. The goal is to pack a list of items into the minimum number of bins using two heuristic approaches: First Fit (FF) and Best Fit (BF). Bin packing problem: Given a collection of items in a file.with corresponding sizes. The size of each item is a floating-point number between 0 and 1