Where Code Meets Intelligence

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]

# AI Analysis Result:
# ⚠️  Time Complexity:  O(n²) — Inefficient for large inputs
# ✅  Space Complexity: O(1) — Constant memory usage
# 💡  Suggestion: Consider using Merge Sort (O(n log n)) for faster performance