🚀 Day 53/150 – Bubble Sort in Python

Bubble Sort is one of the simplest sorting algorithms. It repeatedly compares adjacent elements and swaps them if they are in the wrong order.

Larger elements “bubble” to the end after each pass
Easy to understand, great for learning sorting basics

🔹 Method 1 – Basic Bubble Sort

numbers = [5, 2, 9, 1, 5, 6] n = len(numbers) for i in range(n): for j in range(0, n - i - 1): if numbers[j] > numbers[j + 1]: numbers[j], numbers[j + 1] = numbers[j + 1], numbers[j] print("Sorted List:", numbers) 🔹 Method 2 – Taking User Input

numbers = list(map(int, input("Enter numbers: ").split())) n = len(numbers) for i in range(n): for j in range(0, n - i - 1): if numbers[j] > numbers[j + 1]: numbers[j], numbers[j + 1] = numbers[j + 1], numbers[j] print("Sorted List:", numbers)

🔹 Method 3 – Optimized Bubble Sort

Stops early if the list becomes sorted before all passes are completed.

numbers = [5, 2, 9, 1, 5, 6] n = len(numbers) for i in range(n): swapped = False for j in range(0, n - i - 1): if numbers[j] > numbers[j + 1]: numbers[j], numbers[j + 1] = numbers[j + 1], numbers[j] swapped = True if not swapped: break print("Sorted List:", numbers)

🔹 Method 4 – Using Function

def bubble_sort(arr): n = len(arr) for i in range(n): for j in range(0, n - i - 1): if arr[j] > arr[j + 1]: arr[j], arr[j + 1] = arr[j + 1], arr[j] return arr print(bubble_sort([5, 2, 9, 1, 5, 6]))