sort.py

def sort(l):
   cmp=0
   n = len(l) - 1
   for i in range(n*n):
      pos = i % n
      cmp=cmp+1
      if l[pos] > l[pos+1]:
          l[pos], l[pos+1] = l[pos+1], l[pos]
   print "cmp:", cmp

for i in range(10):
    l=list(reversed(range(i+1)))
    print "i:", i, "list:", l
    sort(l)
    print l