Python progarm for Bubble Sort
codeaft.py
def bubble_sort(nlist):
    for length in range(len(nlist)):
        for i in range(length):
            if nlist[i] > nlist[i + 1]:
                # nlist[i],nlist[i+1]=nlist[i+1],nlist[i]
                temp = nlist[i]
                nlist[i] = nlist[i + 1]
                nlist[i + 1] = temp
                print(nlist)

nlist = [12, 1024, -2048, 0, -1, 95, 987]
bubble_sort(nlist)
print(nlist)
Output
codeaft@codeaft:~$ python3 codeaft.py
[12, -2048, 1024, 0, -1, 95, 987]
[-2048, 12, 1024, 0, -1, 95, 987]
[-2048, 12, 0, 1024, -1, 95, 987]
[-2048, 0, 12, 1024, -1, 95, 987]
[-2048, 0, 12, -1, 1024, 95, 987]
[-2048, 0, -1, 12, 1024, 95, 987]
[-2048, 0, -1, 12, 95, 1024, 987]
[-2048, -1, 0, 12, 95, 1024, 987]
[-2048, -1, 0, 12, 95, 987, 1024]
[-2048, -1, 0, 12, 95, 987, 1024]
codeaft@codeaft:~$ 
Comments and Reactions