Lesson 5: What is Bubble Sort?

The Bubble Sort algorithm involves swapping each consecutive pair of elements in a list into the correct order. Eventually, the largest value “bubbles” its way to the top, hence the name “Bubble” Sort.

Example: Let’s consider the array [7,4,2,9,8,1]. The Python code for the Bubble Sort of this array is:

Array = [7,4,2,9,8,1] 

length = len(Array) 

for m in range(length):
    for n in range(0, length - m - 1):
        if Array[n] > Array[n - 1]:
            Array[n], Array[n + 1], Array[n] 

print("Sorted array is:")
for m in range(len(Array)):
    print("%d" % Array[m])
Sorted array is:
1
2
4
7
8
9