Table - PMC

Skip to main content

View full-text article in PMC

. 2023 Nov 16;23(22):9217. doi: 10.3390/s23229217

Algorithm 1 Binary State Transition Algorithm.

1:
function BSTA(s)
2:
repeat
3:
$B e s t \leftarrow s w a p (B e s t, *)$
4:
$B e s t \leftarrow s h i f t (B e s t, *)$
5:
$B e s t \leftarrow s y m m e t r y (B e s t, *)$
6:
$B e s t \leftarrow s u b s t i t u t e (B e s t, *)$
7:
until the termination condition is met
8:
Return $B e s t$
9:
end function