Given the pseudocode:

procedure bubbleSort$($ A : list of sortable items $)$

n $=$ length$($A$)$

repeat

newn $=0$

for i $=1$ to n$-1$ inclusive do

if A$[$i$-1]>$ A$[$i$]$ then

swap$($A$[$i$-1],$ A$[$i$])$

newn $=$ i

end if

end for

n $=$ newn

until n $=0$

end procedure

$$What is the worst case performance?