40 lines
1008 B
Go
40 lines
1008 B
Go
|
package sequential
|
|||
|
|
|
|||
|
|
/* ---------------------------------------------------------------- *
|
|||
|
|
* IMPORTS
|
|||
|
|
* ---------------------------------------------------------------- */
|
|||
|
|
|
|||
|
|
import (
|
|||
|
|
"fmt"
|
|||
|
|
|
|||
|
|
"ads/internal/core/logging"
|
|||
|
|
"ads/internal/core/metrics"
|
|||
|
|
)
|
|||
|
|
|
|||
|
|
/* ---------------------------------------------------------------- *
|
|||
|
|
* GLOBAL VARIABLES/CONSTANTS
|
|||
|
|
* ---------------------------------------------------------------- */
|
|||
|
|
|
|||
|
|
//
|
|||
|
|
|
|||
|
|
/* ---------------------------------------------------------------- *
|
|||
|
|
* ALGORITHM sequential search
|
|||
|
|
* ---------------------------------------------------------------- */
|
|||
|
|
|
|||
|
|
/*
|
|||
|
|
Inputs: L = Liste von Zahlen, x = Zahl.
|
|||
|
|
Outputs: Position von x in L, sonst −1 wenn x nicht in L.
|
|||
|
|
*/
|
|||
|
|
func SequentialSearch(L []int, x int) int {
|
|||
|
|
n := len(L)
|
|||
|
|
for i := 0; i < n; i++ {
|
|||
|
|
metrics.AddTimeCost()
|
|||
|
|
if L[i] == x {
|
|||
|
|
logging.LogDebug(fmt.Sprintf("Element in Position %[1]v gefunden.", i))
|
|||
|
|
return i
|
|||
|
|
}
|
|||
|
|
logging.LogDebug(fmt.Sprintf("Element nicht in Position %[1]v.", i))
|
|||
|
|
}
|
|||
|
|
return -1
|
|||
|
|
}
|