Python Program for Bubble Sort
Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.
Python
# Python program for implementation of Bubble Sortdef bubbleSort(arr): n = len(arr) # Traverse through all array elements for i in range(n-1): # range(n) also work but outer loop will repeat one time more than needed. # Last i elements are already in place for j in range(0, n-i-1): # traverse the array from 0 to n-i-1 # Swap if the element found is greater # than the next element if arr[j] > arr[j + 1] : arr[j], arr[j + 1] = arr[j + 1], arr[j]# Driver code to test abovearr = [64, 34, 25, 12, 22, 11, 90]bubbleSort(arr)print ("Sorted array is:")for i in range(len(arr)): print ("% d" % arr[i]), |
Please refer complete article on Bubble Sort for more details!
Python
def bubblesort(elements):# Looping from size of array from last index[-1] to index [0]for n in range(len(elements)-1, 0, -1):for i in range(n):if elements[i] > elements[i + 1]:# swapping data if the element is less than next element in the arrayelements[i], elements[i + 1] = elements[i + 1], elements[i]print(elements)elements = []# taking size of array from usersize = int(input("Enter How many number you want to sort:"))# taking array data from the userfor i in range(size):value = int(input("Enter the element:"))elements.append(value)print("Array :", elements)bubblesort(elements)print("Sorted Array is, ")for i in range(size):print(elements[i], end =" ") |
