简化版冒泡排序算法实现

```python def bubble_sort(arr): n = len(arr) for i in range(n - 1): for j in range(n - 1 - i): if arr[j] > arr[j + 1]: arr[j], arr[j + 1] = arr[j + 1], arr[j] return arr # 示例 arr = [64, 34, 25, 12, 22, 11, 90] print(bubble_sort(arr)) ``` ######[AI问答 | 119点数解答 | 2026-02-27 20:55:20]