SortingEasy

Bubble Sort

Repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

Time O(n²) Space O(1)

Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.

Asked in interviews at

GoogleAppleBloombergSamsung

Reference implementation (Python)

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

Embed this visualization

Drop a live, looping Bubble Sort canvas into a blog post or course page.

<iframe src="/embed/bubble-sort" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>

Frequently asked

What is the time and space complexity of Bubble Sort?

Bubble Sort runs in O(n²) time and O(1) auxiliary space.

Is the Bubble Sort visualizer free?

The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.

Which companies ask Bubble Sort in interviews?

Bubble Sort shows up in interviews at Google, Apple, Bloomberg, Samsung.

How does the 3D visualization of Bubble Sort work?

Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.

More Sorting