python练习冒泡排序

效率略满，时间复杂度为n(n-1)/2

import sys
import random
def getrandata(num):
    b=[]
    i=0
    while i<num:
        b.append(random.randint(0,50))
        i+=1
    return b
def bubble(a):
    k=0
    l=len(a)
    print a,l
    for i in range(l):
        for k in range(l-1):
            if a[k]>a[k+1]:
                tmp=a[k]
                a[k]=a[k+1]
                a[k+1]=tmp
                print a
                print k
                print i
    return a
'''def bubbles(x,n):
    for i in range(n):
        for j in range(n-1):
            if x[j]>x[j+1]:
                t = x[j]
                x[j] = x[j+1]
                x[j+1] = t
    return x'''
if __name__ == "__main__":
    x=input("the num is ")
    print bubble(getrandata(x))