Bubble Sort Algorithm

def bubbleSort(nums):
    n = len(nums)
    for i in range(n):
        # Flag to optimize by checking if any swaps occurred
        swapped = False
        # Last i elements are already in place
        for j in range(0, n - i - 1):
            if nums[j] > nums[j + 1]:
                # Swap adjacent elements
                nums[j], nums[j + 1] = nums[j + 1], nums[j]
                swapped = True
        # If no swaps occurred, array is sorted
        if not swapped:
            break
    return nums

# Example usage
nums = [64, 34, 25, 12, 22, 11, 90]
print(bubbleSort(nums))  # Output: [11, 12, 22, 25, 34, 64, 90]