• WIRTH, N. Algoritmy a štruktúry údajov. Alfa, 1989.
• SEDGEWICK, R. Algoritmy v C, části 1- 4: základy, datové struktury, třídění, vyhledávání. Praha, Softpress, 2003. 80-86497-56-9
• CORMEN, T. H., LEISERSON C. E., RIVEST D. L., STEIN C. Introduction to Algorithms, Second Edition. MIT Press, 2001. 0-07-013151-1
• KNUTH, D. The Art of Computer Programming, Volume 3, Sorting and Searching, Second Edition. Addison-Wesley, 2005. 0-201-89685-0

procedure bubbleSort( A : list of sortable items )
   n = length(A)
   repeat 
     swapped = false
     for i = 1 to n-1 inclusive do
       /* if this pair is out of order */
       if A[i-1] > A[i] then
         /* swap them and remember something changed */
         swap( A[i-1], A[i] )
         swapped = true
       end if
     end for
   until not swapped
end procedure