def bubbleSort( theSeq ):
n = len( theSeq )
# Perform n-1 bubble operations on the sequence
for i in range( n - 1 ) :
# Bubble the largest item to the end.
for j in range( n - i -1 ) :
if theSeq[j] > theSeq[j + 1] : # swap the j and j+1 items.
tmp = theSeq[j]
theSeq[j] = theSeq[j + 1]
theSeq[j + 1] = tmp
In [42]: import random
In [50]: aList = []
In [51]: for i in range(20):
....: aList.append(random.randint(1,20))
....:
In [52]: aList
Out[52]: [17, 15, 2, 15, 8, 20, 1, 11, 8, 3, 5, 2, 17, 2, 3, 16, 7, 11, 18, 17]
In [53]: bubbleSort(aList)
In [54]: aList
Out[54]: [1, 2, 2, 2, 3, 3, 5, 7, 8, 8, 11, 11, 15, 15, 16, 17, 17, 17, 18, 20]
def bubbleSort( theSeq ): n = len( theSeq ) # Perform n-1 bubble operations on the sequence for i in range( n - 1 ) : # Bubble the largest item to the end. for j in range(