hello-algo/en/codes/go/chapter_greedy/fractional_knapsack.go

// File: fractional_knapsack.go
// Created Time: 2023-07-23
// Author: Reanon (793584285@qq.com)

package chapter_greedy

import "sort"

/* Item */
type Item struct {
	w int // Item weight
	v int // Item value
}

/* Fractional knapsack: Greedy algorithm */
func fractionalKnapsack(wgt []int, val []int, cap int) float64 {
	// Create item list with two attributes: weight, value
	items := make([]Item, len(wgt))
	for i := 0; i < len(wgt); i++ {
		items[i] = Item{wgt[i], val[i]}
	}
	// Sort by unit value item.v / item.w from high to low
	sort.Slice(items, func(i, j int) bool {
		return float64(items[i].v)/float64(items[i].w) > float64(items[j].v)/float64(items[j].w)
	})
	// Loop for greedy selection
	res := 0.0
	for _, item := range items {
		if item.w <= cap {
			// If remaining capacity is sufficient, put the entire current item into the knapsack
			res += float64(item.v)
			cap -= item.w
		} else {
			// If remaining capacity is insufficient, put part of the current item into the knapsack
			res += float64(item.v) / float64(item.w) * float64(cap)
			// No remaining capacity, so break out of the loop
			break
		}
	}
	return res
}