What would be the time complexity of the following algorithm?

reverse$($a$)$:

for i $=1$ to len$($a$)-1$

x $=$ a$[$i$]$

for j $=$ i downto $1$

a$[$j$]=$ a$[$j$-1]$

a$[0]=$ x