Python · Theory

Bubble Sort in Python

Theory

78/268

Bubble Sort in Python

Bubble sort compares neighbours and swaps if they are out of order. Large values drift to the end like bubbles. Easy to trace on [4, 1, 3, 2]. Slow on big lists — about O(n²). Good for learning swaps. Real code uses sorted() / list.sort() (Timsort). Say that honestly.

One pass idea + complexity + “not for production size” is the full answer. Don’t implement bubble in a live project when sorted() exists.

Bubble Sort in Python — output — [1, 2, 3, 4]. Neighbours swap until sorted.

Exam tip

Complexity + why not used for big data.

Example

# Bubble sort
a = [4, 1, 3, 2]
n = len(a)
for i in range(n):
    for j in range(0, n - i - 1):
        if a[j] > a[j + 1]:
            a[j], a[j + 1] = a[j + 1], a[j]
print(a)

Bubble Sort in Python — output: [1, 2, 3, 4]. Neighbours swap until sorted.

Short notes

DefSwap neighbour pairs.
RuleO(n²). Teaching sort.
RememberReal code → sorted().

Python · Theory

Bubble Sort in Python

← All stacks

Theory

78/268

Bubble Sort in Python

One pass idea + complexity + “not for production size” is the full answer. Don’t implement bubble in a live project when sorted() exists.

Bubble Sort in Python — output — [1, 2, 3, 4]. Neighbours swap until sorted.

Exam tip

Complexity + why not used for big data.

Example

# Bubble sort
a = [4, 1, 3, 2]
n = len(a)
for i in range(n):
    for j in range(0, n - i - 1):
        if a[j] > a[j + 1]:
            a[j], a[j + 1] = a[j + 1], a[j]
print(a)

Bubble Sort in Python — output: [1, 2, 3, 4]. Neighbours swap until sorted.

Short notes

DefSwap neighbour pairs.
RuleO(n²). Teaching sort.
RememberReal code → sorted().

Bubble Sort in Python

Example

Short notes

Questions

Bubble Sort in Python

Example

Short notes

Questions