Home » Python » Python programs

# Python program for Bubble Sort

**Bubble Sort in Python**: Here, we are going to learn to implement bubble sort in an array or list in python.

Submitted by Soumya Sinha, on December 27, 2020

**Bubble Sort**: Bubble sort is a sorting algorithm that is used to sort an array or list.

**Description**:

Bubble Sort is one of the easiest sorting algorithms among all other sorting algorithms. In this algorithm, one needs to repeatedly compare the elements one by one and swap the adjacent elements to bring them in the correct sorted order. If there are n number of elements within the array then each element will undergo n-1 comparisons. This way after comparing one element with other elements within the array, an element is placed at its place in the sorted list similar to a bubble rising up and moving. That is why this algorithm is known as Bubble Sort. The number of comparisons in this algorithm is more thus its complexity is more.

**Procedure for Bubble Sort**:

BubbleSort (arr): n =len(arr) For i=0 to n-1: For j=1 to n-i-1: If arr[i] > arr[j]: Swap(arr[i],arr[j])

**Example:**

**First Pass:**

( **7** **5** 0 2 4 ) –> ( **5** **7** 0 2 4 ), The algorithm compares the first two elements, and swaps since 7 > 5.

( 5 **7** **0** 2 4 ) –> ( 5 **0** **7** 2 4 ), Swap since 7 > 0

( 5 0 **7** **2** 4 ) –> ( 5 0 **2** **7** 4 ), Swap since 7 > 2

( 5 0 2 **7** **4** ) –> ( 5 0 2 **4** **7** ), Swap since 7 > 4

**Second Pass:**

( **5** **0** 2 4 7 ) –> ( **0** **5** 2 4 7 ), Swap since 5 > 0

( 0 **5** **2** 4 7 ) –> ( 0 **2** **5** 4 7 ), Swap since 5 > 2

( 0 2 **4** **5** 7 ) –> ( 0 2 **4** **5** 7 ), No swap as the elements are already sorted

( 0 2 4 **5** **7** ) –> ( 0 2 4 **5** **7** ), No swap as the elements are already sorted

We can see that the array is already sorted, but our algorithm does not know this. The algorithm needs one complete pass without any swap to know if the array is sorted or not.

**Third Pass:**

( **0** **2** 4 5 7 ) –> ( **0** **2** 4 5 7 )

( 0 **2** **4** 5 7 ) –> ( 0 **2** **4** 5 7 )

( 0 2 **4** **5** 7 ) –> ( 0 2 **4** **5** 7 )

( 0 2 4 **5** **7** ) –> ( 0 2 4 **5** **7** )

**Time Complexity: **O(n^2)

## Python code for bubble sort

import sys def bubble_sort(arr): # This function will sort the array in non-decreasing order. n = len(arr) #Traverse through all the array elements for i in range(n): # The inner loop will run for n-i-1 times as the # last i elements are already in place. for j in range(0, n-i-1): # Swap if the present element is greater than the # next element. if arr[j] > arr[j+1]: temp = arr[j] arr[j] = arr[j+1] arr[j+1] = temp return arr # main code if __name__=='__main__': arr = [2, 1, 9, 3, 7, 5, 6, 4, 8, 0] print("Sorted array: ") print(bubble_sort(arr))

**Output:**

Sorted array: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

**Optimized Implementation:**

The above function always runs O(n^2) time even though the array is sorted. We can prevent this by stopping the algorithm if inner loop didn’t cause any swap.

**OPTIMIZED PYTHON CODE**

import sys def bubble_sort(arr): # This function will sort the array in non-decreasing order. n = len(arr) #Traverse through all the array elements for i in range(n): swap = False # The inner loop will run for n-i-1 times as the # last i elements are already in place. for j in range(0, n-i-1): # Swap if the present element is greater than the # next element. if arr[j] > arr[j+1]: temp = arr[j] arr[j] = arr[j+1] arr[j+1] = temp swap = True # If no two elements were swapped # by inner loop, then break if swap == False: break return arr # main code if __name__=='__main__': arr = [2, 1, 9, 3, 7, 5, 6, 4, 8, 0] print("Sorted array: ") print(bubble_sort(arr))

**Time Complexity: **

- Best Case: O(n)
- Worst Case: O(n^2)

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions