DSA · Theory

Insertion Sort Algorithm

← All stacks

Theory

49/810

Insertion Sort Algorithm

Insertion Sort Algorithm sits in the roll list. Kabir’s job is names A→Z. Write that first.

For Insertion Sort Algorithm, time vs memory is in play. Don’t blame it until you have traced names A→Z.

Insertion Sort Algorithm exists so Kabir can keep names A→Z correct in the roll list.

Kabir ships Insertion Sort Algorithm in the roll list. That is the use case worth saying.

Don’t do this with Insertion Sort Algorithm: unstable sort when equal keys matter. Interviewers spot it in ten seconds.

Place Insertion Sort Algorithm next to nearby DSA work — n log n vs n² is the link.

Viva for Insertion Sort Algorithm — what it is → n log n vs n² → the mistake (unstable sort when equal keys matter).

Exam tip

Board: names A→Z. Dry-run Insertion Sort Algorithm. Name the trap: unstable sort when equal keys matter.

Example

def insertion_sort(arr):
    a = arr[:]
    for i in range(1, len(a)):
        key = a[i]
        j = i - 1
        while j >= 0 and a[j] > key:
            a[j + 1] = a[j]
            j -= 1
        a[j + 1] = key
    return a

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

Insertion Sort Algorithm — insertion sort grows a sorted prefix by placing each next item correctly.

Short notes

DefInsertion Sort Algorithm — Kabir uses it for names A→Z in the roll list.
RuleInsertion Sort Algorithm → n log n vs n².
RememberInsertion Sort Algorithm + time vs memory (the roll list).
UseInsertion Sort Algorithm in the roll list (names A→Z).
TrapInsertion Sort Algorithm — unstable sort when equal keys matter.
ExInsertion Sort Algorithm → names A→Z.

def insertion_sort(arr): a = arr[:] for i in range(1, len(a)): key = a[i] j = i - 1 while j >= 0 and a[j] > key: a[j + 1] = a[j] j -= 1 a[j + 1] = key return a print(insertion_sort([5, 1, 4, 2]))

Insertion Sort Algorithm

Example

Short notes

Questions

Insertion Sort Algorithm

Example

Short notes

Questions