maximization knapsack solution using Go (Greedy Approach)

Maximization_Knapsack_Greedy_Approach.go

package main

import (
    "fmt"
    "errors"
)

func getMax(arr []int) int {

  var max int = 0
  var index int = 0
  for i, val := range arr {
    if max < val{
      max = val
      index = i
    }
  }

  return index
}

func main() {
    var values []int = []int{10, 5, 15, 7, 6, 18, 3}
    var items []int = []int{2, 3, 5, 7, 1, 4, 1}
    var valuePerItem []int
    var valuePerItemBak []int
    var capacity int = 15
    
    if len(items) != len(values){
        fmt.Println("=======error==", errors.New("Invalid value or items."))
    }else {
        
        for i:=0; i<len(items); i++ {
            val := values[i]/items[i]
            valuePerItem = append(valuePerItem, val)
        }

        valuePerItemBak = append(valuePerItemBak, valuePerItem...)
        var sumVal int = 0
        var sumItem int = 0
        for sumItem <= capacity {
          index := getMax(valuePerItem)
          valuePerItem[index] = 0
          sumVal += values[index]
          sumItem += items[index]
        }

        fmt.Println("values       : ", values)
        fmt.Println("items        : ", items)
        fmt.Println("valuePerItem : ", valuePerItemBak)
        fmt.Println("sumVal       : ", sumVal)
        fmt.Println("sumItem      : ", sumItem)
    }
}