Summary - Bubble sort

Implement bubble sort and print the result.

Summary - Bubble sort

In this group you learned bubble sort's logic, one pass, full sort and sorted check. Complexity is O(n^2).

Bubble sort is simple but slow. The optimized version can achieve best case O(n) by stopping when no swap occurs.

Exercise Full bubble sort

Write bubble_full(arr). Sort with two loops and return. Print [1, 2, 5, 8] with print(bubble_full([5, 2, 8, 1])).

Show example solution

def bubble_full(arr):
    # Fully sort
    n = len(arr)
    for i in range(n):
        for j in range(n - 1):
            if arr[j] > arr[j + 1]:
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
    return arr
print(bubble_full([5, 2, 8, 1]))

Test yourself

Summary - Bubble sort: match the terms

Bubble sort

Compare neighbors
O(n^2)

Worst
Swap

Exchange
Sorted

O(n) best

Bubble sort

Bubble sort sorts ____ elements.

Show answer

Bubble sort sorts adjacent elements.

How long does bubble sort take in the best case?
- O(n^2)
- O(n log n)
- O(1)
- O(n)
Show answer

O(1) — The best case is O(n).

Next lesson: Selection sort idea

We Are Enhancing Your Experience

Cookie Preferences

Strictly Necessary Cookies

Analytical Cookies