DSA · Theory

Bubble Sort Algorithm

← All stacks

Theory

48/810

Bubble Sort Algorithm

Don’t start Bubble Sort Algorithm with jargon. Start with names A→Z. That is the whole point.

Do Bubble Sort Algorithm once by hand. n log n vs n². Change one input. Say the new result out loud.

Skip Bubble Sort Algorithm and unstable sort when equal keys matter shows up in the roll list.

Vikram ships Bubble Sort Algorithm in the roll list. That is the use case worth saying.

If names A→Z breaks under Bubble Sort Algorithm, check unstable sort when equal keys matter first.

After Bubble Sort Algorithm, Vikram should still remember unstable sort when equal keys matter.

Close Bubble Sort Algorithm with — “If I skip it, names A→Z goes wrong like this: unstable sort when equal keys matter.”

Exam tip

For Bubble Sort Algorithm: definition + the roll list + one failure.

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]))

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

Short notes

DefBubble Sort Algorithm — Vikram uses it for names A→Z in the roll list.
RuleBubble Sort Algorithm → n log n vs n².
RememberBubble Sort Algorithm + time vs memory (the roll list).
UseBubble Sort Algorithm in the roll list (names A→Z).
TrapBubble Sort Algorithm — unstable sort when equal keys matter.
ExBubble Sort Algorithm → names A→Z.

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]))

Bubble Sort Algorithm

Example

Short notes

Questions

Bubble Sort Algorithm

Example

Short notes

Questions