DSA 部分简单

冒泡排序

“冒泡排序”问题的详细指南和 Python 实现。

问题陈述

简单

编写一个函数 bubble_sort(arr),使用冒泡排序算法对整数列表 arr 进行升序排序,并返回排序后的列表。

约束条件
  • 0 <= len(arr) <= 500
  • -10^4 <= arr[i] <= 10^4

示例

Example 1
Input
arr = [5, 1, 4, 2, 8]
Output
[1, 2, 4, 5, 8]
Explanation

Bubble sort repeatedly swaps adjacent elements if they are in the wrong order until the array is sorted.

Example 2
Input
arr = [3, 2, 1]
Output
[1, 2, 3]
Explanation

We swap 3 and 2 -> [2, 3, 1], then 3 and 1 -> [2, 1, 3], then 2 and 1 -> [1, 2, 3].

Need a Hint?
考虑使用特定于排序的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。