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 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。