What is the time complexity of the following algorithm?

Algorithm $1$: Modified NCCLA Algorithm

begin

$t=0$;

Initialize the crow's behaviors within the family $F[n]=[x_1,x_2,$dots,$x_n]$;

Evaluate each behavior $x_i$ in $F$ using $f(x_i)$;

Rank all behaviors and determine parent's behavior $x_1$ and $x_2$ at positions $1$ and $2,$

respectively:;

while termination criterion not met do

for each juvenile $i$ in the family $F$ do

$/*$ update behavior $x_i$ through either social or asocial

learning

for each attribute $j$ in the behavior $x_i$ do

if rand $S{L}_{\text{p}\text{r}\text{o}\text{b}}$ then

if rand $VS{L}_{\text{p}\text{r}\text{o}\text{b}}$ then

$x_{i,j(t)}=\frac{x_{pk,j(t-1)\text{;}}}{?}*pk$ equals either $1$ or $2$

according to $P{1}_{\text{p}\text{r}\text{o}\text{b}}$

else

$x_{i,j(t)}=x_{sk,j(t-1)}\frac{\text{;}}{*}*sk$ is any juvenile with a

better behavior than $i$

end

else

if rand $Ta{E}_{\text{p}\text{r}\text{o}\text{b}}$ then

$x_{i,j(t)}=x_L+U(0,1)(x_U-x_L)\frac{\text{;}}{*}*j$ is a new random

else

attribute

$x_{i,j(t)}=x_{i,j(t-1)}$; $/*$ keep the previous attribute $j$

end

end

end

With $R{p}_{\text{p}\text{r}\text{o}\text{b}\text{,}},$ reinforce certain attributes of the modified $x_i$ using Eq$.(6)$

and Eq$.(10)$;

end

With $R{p}_{\text{p}\text{r}\text{o}\text{b}},$ parent $1x_1$ and parent$2x_2$ are reinforced according to Eq$.(12)$ ;

Rank all behaviors and select the two best behaviors to be new parents $x_1$ and

$x_2$ :

$t=t+1$

end

end

Return the global best solution or accepted $($adult$-$like$)$ behavior $x^{**}$;