DSA · Theory

Recursive Bubble Sort

Theory

464/810

Recursive Bubble Sort

Recursive Bubble Sort is a DSA topic. In plain words you use it for names A→Z in the roll list. Don’t start with a slogan — start with that picture.

Smallest example: n log n vs n². Type it, run it, and say what you see. If you can do that from memory, you know Recursive Bubble Sort.

From the example next to this theory — Recursive Bubble Sort — bubble sort swaps adjacent out-of-order pairs repeatedly.

Trap — unstable sort when equal keys matter. Fix that before you talk about advanced DSA.

Viva — what is Recursive Bubble Sort? Then show n log n vs n². Then name the trap.

Exam tip

What is Recursive Bubble Sort? Show this: n log n vs n². Trap: unstable sort when equal keys matter.

Example

def bubble_sort(arr):
    a = arr[:]
    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]
    return a

print(bubble_sort([5, 1, 4, 2]))

Recursive Bubble Sort — bubble sort swaps adjacent out-of-order pairs repeatedly.

Short notes

DefRecursive Bubble Sort — names A→Z in the roll list.
Rulen log n vs n²
Trapunstable sort when equal keys matter
Usethe roll list

DSA · Theory

Recursive Bubble Sort

← All stacks

Theory

464/810

Recursive Bubble Sort

Recursive Bubble Sort is a DSA topic. In plain words you use it for names A→Z in the roll list. Don’t start with a slogan — start with that picture.

Smallest example: n log n vs n². Type it, run it, and say what you see. If you can do that from memory, you know Recursive Bubble Sort.

From the example next to this theory — Recursive Bubble Sort — bubble sort swaps adjacent out-of-order pairs repeatedly.

Trap — unstable sort when equal keys matter. Fix that before you talk about advanced DSA.

Viva — what is Recursive Bubble Sort? Then show n log n vs n². Then name the trap.

Exam tip

What is Recursive Bubble Sort? Show this: n log n vs n². Trap: unstable sort when equal keys matter.

Example

def bubble_sort(arr):
    a = arr[:]
    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]
    return a

print(bubble_sort([5, 1, 4, 2]))

Recursive Bubble Sort — bubble sort swaps adjacent out-of-order pairs repeatedly.

Short notes

DefRecursive Bubble Sort — names A→Z in the roll list.
Rulen log n vs n²
Trapunstable sort when equal keys matter
Usethe roll list

Recursive Bubble Sort

Example

Short notes

Questions

Recursive Bubble Sort

Example

Short notes

Questions