What is its runtime complexity of the following algorithm, Explain!

Start

arrange $($myarray$)\{$

change $($myarray$,$ value$1,$ value$2)\{$

c$=$ myarray $[$value$1]$;

myarray $[$value$1]=$ myarray $[$value$2]$;

myarray $[$value$2]=$ c;

$\}$

counter $=1$;

while $($counter $<$ myarray.length$)\{$

changecount $=0$;

for $$let i$=0$; i myarray $[$i$+1]\{$

change $$myarray$,$ i$,$ i$+1)$;

changeCount$++$

$\}\}$

counter$++$;

return myarray;

End