Sort $6,2,5,4,3$ in increasing order using the following algorithm

sort$(a(1),$dots,$a(n)$ : real numbers with $n2)$

for $i$:$=1$ to $n-1$

for $j$:$=1$ to $n-i$

if $a(j)>a(j+1)$ then interchange $a(j)$ and $a(j+1)$

is in increasing order