The bubble sort makes multiple passes through a list. It compares adjacent items and exchanges those that are out of order. Each pass through the list places the next largest value in its proper place. In essence, each item “bubbles” up to the location where it belongs.

Resources for Review

Check out the resources below for a review of Bubble sort!

• Wikipedia
• Visual Algo
• Animation
• Sorting Algorithms Animcation with Pseudocode

def bubble_sort(arr):
    # For every element (arranged backwards)
    for n in range(len(arr)-1,0,-1):
        #
        for k in range(n):
            # If we come to a point to switch
            if arr[k]>arr[k+1]:
                temp = arr[k]
                arr[k] = arr[k+1]
                arr[k+1] = temp

arr = [3,2,13,4,6,5,7,8,1,20]
bubble_sort(arr)
print(arr)

[1, 2, 3, 4, 5, 6, 7, 8, 13, 20]

Follow Me

If you like my post please follow me to read my latest post on programming and technology.

Instagram

Facebook

Hassan Raza