$152$ points following sorting algorithm:

for $i$:$=1toNdo$

begin

$x$:$=1$

for $j$:$=1toNdo$

$ifA[j]>A[i]$ then

$,x$:$=x+1$

$B[x]$:$=A[i]$

end

for $i$:$=N$ downto $1do$

$A[N-i+1]$:$=B[i]$

for $i$:$=N$ downto $1$ do

Explain how the algorithm sorts array $A.$ Also, give the time complexity of the algorithm.