কন্টিগুয়াস মেমরি অ্যালোকেশন

# first-fit, best-fit, worst-fit -- একই হোল তালিকা ও একই অনুরোধের বিপরীতে
def first_fit(holes, size):
    for i, (start, hole_size) in enumerate(holes):
        if hole_size >= size:
            return i
    return None

def best_fit(holes, size):
    best_i, best_size = None, None
    for i, (start, hole_size) in enumerate(holes):
        if hole_size >= size and (best_size is None or hole_size < best_size):
            best_i, best_size = i, hole_size
    return best_i

def worst_fit(holes, size):
    worst_i, worst_size = None, None
    for i, (start, hole_size) in enumerate(holes):
        if hole_size >= size and (worst_size is None or hole_size > worst_size):
            worst_i, worst_size = i, hole_size
    return worst_i

def run_strategy(strategy_fn, name):
    holes = [(0, 100), (100, 500), (600, 200), (800, 300), (1100, 600)]
    requests = [212, 417, 112, 426]
    print(f"--- {name} ---")
    for req in requests:
        idx = strategy_fn(holes, req)
        if idx is None:
            print(f"অনুরোধ {req}: কোনো হোল যথেষ্ট বড় নয় -> ব্যর্থ")
            continue
        start, hole_size = holes[idx]
        print(f"অনুরোধ {req}: হোল নির্বাচিত -> start={start}, size={hole_size}")
        leftover = hole_size - req
        if leftover > 0:
            holes[idx] = (start + req, leftover)
        else:
            holes.pop(idx)
    tiny_holes = [h for h in holes if h[1] < 90]
    print("অবশিষ্ট হোলসমূহ:", holes)
    print(f"ছোট/অকেজো হোল (< 90 ইউনিট): {len(tiny_holes)}\n")

run_strategy(first_fit, "First-Fit")
run_strategy(best_fit, "Best-Fit")
run_strategy(worst_fit, "Worst-Fit")