Answer:
n := length(A)
repeat
swapped := false
for i := 1 to n-1 inclusive do
<em> /* if this pair is out of order */</em>
if A[i-1] > A[i] then
<em> /* swap them and remember something changed */</em>
swap(A[i-1], A[i])
swapped := true
end if ⇒
end for
until not swapped
end procedure
Explanation:
This is pseudocode
