137 lines
3.1 KiB
Go
137 lines
3.1 KiB
Go
|
package maxsubsum
|
||
|
|
||
|
import (
|
||
|
"fmt"
|
||
|
|
||
|
"ads/internal/core/metrics"
|
||
|
"ads/internal/setup"
|
||
|
)
|
||
|
|
||
|
/* ---------------------------------------------------------------- *
|
||
|
* IMPORTS
|
||
|
* ---------------------------------------------------------------- */
|
||
|
|
||
|
/* ---------------------------------------------------------------- *
|
||
|
* GLOBAL VARIABLES/CONSTANTS
|
||
|
* ---------------------------------------------------------------- */
|
||
|
|
||
|
//
|
||
|
|
||
|
/* ---------------------------------------------------------------- *
|
||
|
* CHECKS
|
||
|
* ---------------------------------------------------------------- */
|
||
|
|
||
|
func preChecks(L []int, _ ...interface{}) error {
|
||
|
if !(len(L) > 0) {
|
||
|
return fmt.Errorf("Liste darf nicht leer sein.")
|
||
|
}
|
||
|
return nil
|
||
|
}
|
||
|
|
||
|
func postChecks(L []int, _ ...interface{}) error {
|
||
|
// TODO
|
||
|
return nil
|
||
|
}
|
||
|
|
||
|
/* ---------------------------------------------------------------- *
|
||
|
* METHOD Algorithm + Display
|
||
|
* ---------------------------------------------------------------- */
|
||
|
|
||
|
func FancyMaxSubSum(input_L []int) (int, int, int, error) {
|
||
|
var name = "MaxSubSum (Maximale Teilsumme)"
|
||
|
var inputs = map[string]interface{}{
|
||
|
"L": input_L,
|
||
|
}
|
||
|
var outputs map[string]interface{}
|
||
|
var (
|
||
|
output_maxSum int
|
||
|
output_indexFrom int
|
||
|
output_indexTo int
|
||
|
)
|
||
|
var err error
|
||
|
|
||
|
do_once := true
|
||
|
for do_once {
|
||
|
do_once = false
|
||
|
setup.DisplayStartOfAlgorithm(name, inputs)
|
||
|
metrics.RestartMetrics()
|
||
|
|
||
|
// Prechecks:
|
||
|
err = preChecks(input_L)
|
||
|
if err != nil {
|
||
|
break
|
||
|
}
|
||
|
|
||
|
// Ausführung des Algorithmus:
|
||
|
output_maxSum, output_indexFrom, output_indexTo = MaxSubSum(input_L)
|
||
|
outputs = map[string]interface{}{
|
||
|
"maxSum": output_maxSum,
|
||
|
"index_from": output_indexFrom,
|
||
|
"index_to": output_indexTo,
|
||
|
}
|
||
|
|
||
|
// Letzte Messages:
|
||
|
setup.DisplayMetrics()
|
||
|
setup.DisplayEndOfAlgorithm(outputs)
|
||
|
|
||
|
// Postchecks:
|
||
|
err = postChecks(input_L, output_maxSum, output_indexFrom, output_indexTo)
|
||
|
if err != nil {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return output_maxSum, output_indexFrom, output_indexTo, err
|
||
|
}
|
||
|
|
||
|
/* ---------------------------------------------------------------- *
|
||
|
* ALGORITHM max sub sum (D & C)
|
||
|
* ---------------------------------------------------------------- */
|
||
|
|
||
|
func FancyMaxSubSumDC(input_L []int) (int, int, int, error) {
|
||
|
var name = "MaxSubSum (Maximale Teilsumme mit D & C)"
|
||
|
var inputs = map[string]interface{}{
|
||
|
"L": input_L,
|
||
|
}
|
||
|
var outputs map[string]interface{}
|
||
|
var (
|
||
|
output_maxSum int
|
||
|
output_indexFrom int
|
||
|
output_indexTo int
|
||
|
)
|
||
|
var err error
|
||
|
|
||
|
do_once := true
|
||
|
for do_once {
|
||
|
do_once = false
|
||
|
setup.DisplayStartOfAlgorithm(name, inputs)
|
||
|
metrics.RestartMetrics()
|
||
|
|
||
|
// Prechecks:
|
||
|
err = preChecks(input_L)
|
||
|
if err != nil {
|
||
|
break
|
||
|
}
|
||
|
|
||
|
// Ausführung des Algorithmus:
|
||
|
output_maxSum, output_indexFrom, output_indexTo = MaxSubSumDC(input_L)
|
||
|
outputs = map[string]interface{}{
|
||
|
"maxSum": output_maxSum,
|
||
|
"index_from": output_indexFrom,
|
||
|
"index_to": output_indexTo,
|
||
|
}
|
||
|
|
||
|
// Letzte Messages:
|
||
|
setup.DisplayMetrics()
|
||
|
setup.DisplayEndOfAlgorithm(outputs)
|
||
|
|
||
|
// Postchecks:
|
||
|
err = postChecks(input_L, output_maxSum, output_indexFrom, output_indexTo)
|
||
|
if err != nil {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return output_maxSum, output_indexFrom, output_indexTo, err
|
||
|
}
|