Data Structure & Algorithm

Bubble Sort

Repeatedly steps through list, compares adjacent items and swaps them if in wrong order. Highest element bubbles up to top.

IDLE

Ready: Click Play or Next Step to start the visualization.

Step 0 of 0

Comparisons: 0

Swaps / Shifts: 0

Active Index: -

Time Complexity: O(n^2)

Time Complexity

Best Case O(n)

Average O(n^2)

Worst Case O(n^2)

Space & Structure

Auxiliary Space O(1)

In-Place? Yes

Category Sorting

Real-World Engineering Application

Educational concept demonstrations, verifying if array is already sorted in O(n) check.

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        swapped = False
        for j in range(0, n - i - 1):
            if arr[j] > arr[j + 1]:
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
                swapped = True
        if not swapped: break
    return arr