Bubble Sort in Python

def bubble_sort(arr):
    n = len(arr)
    
    # Traverse through all elements in the list
    for i in range(n):
        # Flag to optimize the algorithm
        swapped = False
        
        # Last i elements are already in place, so we don't need to check them
        for j in range(0, n-i-1):
            # If the element found is greater than the next element, swap them
            if arr[j] > arr[j+1]:
                arr[j], arr[j+1] = arr[j+1], arr[j]  # Swap the elements
                swapped = True  # Set the swapped flag to True
        
        # If no two elements were swapped in the inner loop, the list is sorted
        if not swapped:
            break

# Example usage:
if __name__ == "__main__":
    my_list = [64, 34, 25, 12, 22, 11, 90]
    print("Original list:", my_list)
    
    bubble_sort(my_list)
    
    print("Sorted list:", my_list)