Pseudo code
BUBBLESORT(A)
1 for i=1 to A.length-1
2 for j=A.length downto i+1
3 if A[j] < A[j-1]
4 exchange A[j] with A[j-1]
Reference
<< Introduction to Algorithms >> Third Edition, THOMAS H. CORMEN, CHARLES E. LEISERSON, RONALD L. RIVEST, CLIFFORD STEIN.