Bubble Sort algorithm in Python

Hello everyone, Welcome back to Programming In Python. Here in this post, I will continue with the algorithm’s series, in previous posts I have discussed searching techniques like Linear Search and Binary Search. Here I am going to say about a sorting technique called Bubble Sort. So let us start with the Bubble sort algorithm in Python.

Bubble Sort is one of the simple sorting techniques where it traverses the whole list by comparing its adjacent elements, sorting them, and swapping the elements until the whole list is sorted.

You can also watch the video on YouTube here

Bubble Sort Algorithm – Code Visualization

Program on GitHub

Time Complexity of Bubble Sort

Best Case	O(n)
Average Case	O(n²)
Worst Case	O(n²)

Algorithm:

Given a list L of n elements with values or records L0, L1, …, Ln-1, bubble sort is applied to sort the list L.

Compare the first two elements L0, L1 on the list.
if L1 < L0, swap those elements and continue with the next 2 elements.
Repeat the same step until whole the list is sorted, so no more swaps are possible.
Return the final sorted list.

Program on GitHub

Ad:
Learn Python Programming Masterclass – Enroll Now.
Udemy

Program:

__author__ = 'Avinash'

def bubble_sort(sort_list):
    for j in range(len(sort_list)):
        for k in range(len(sort_list) - 1):
            if sort_list[k] > sort_list[k + 1]:
                sort_list[k], sort_list[k + 1] = sort_list[k + 1], sort_list[k]
    print(sort_list)

lst = []
size = int(input("Enter size of the list: \t"))

for i in range(size):
    elements = int(input("Enter the element: \t"))
    lst.append(elements)

bubble_sort(lst)