How many swap$($s$)$ is$/$are required to sort an array of $n=3$ integers: $10,30,6$ using this version of Bubble Sort?

for $(A[i]>A[i+1])swap(A[i],A[i+1])(i=0$;$i$; $++i)$

$if(A[i]>A[i+1])$

swap$(A[i],A[i+1])$;