Bubble sort python implementation

bubbleSort.py

def bubbleSort(l):
    for n in range(len(l),1,-1):
        no_switch = 0
        for i in range(0,n-1):
    	    if l[i] > l[i+1]:
    		    l[i], l[i+1] = l[i+1], l[i]
    		    switch+=1
        if no_switch == 0:
            break
    	
		
egList = [1,2,3,4,5,6,7,8,9,10]
bubbleSort(egList)
print(egList)