DSA SectionEasy

Bubble Sort

Detailed guide and Python implementation for the 'Bubble Sort' problem.

Problem Statement

Easy

Write a function bubble_sort(arr) that sorts a list of integers arr in ascending order using the Bubble Sort algorithm and returns the sorted list.

Constraints
  • 0 <= len(arr) <= 500
  • -10^4 <= arr[i] <= 10^4

Examples

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?
Consider using Sorting-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

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

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.