BubbleSort is a popular but inecient sorting algorithm. It works by repeatedly swapping adjacent elements that are out of order, and doing so enough times that there can be no more elements out of order.

$1$:

$2$:

$3$:

$4$:

$5$:

BubbleSort$($A$[1..$n$])$ for i $=1$ to n $1$

for j $=$ n downto i $+1$ if A$[$j$]$