DSA · Theory

Differences between Insertion Sort and Selection Sort

Theory

484/810

Differences between Insertion Sort and Selection Sort

Differences between Insertion Sort and Selection Sort is a DSA idea you prove with names A→Z, not with a slogan.

Do Differences between Insertion Sort and Selection Sort once by hand. n log n vs n². Change one input. Say the new result out loud.

Differences between Insertion Sort and Selection Sort exists so Neha can keep names A→Z correct in the roll list.

Differences between Insertion Sort and Selection Sort shows up in the roll list. Name names A→Z, not “a real-world scenario”.

Differences between Insertion Sort and Selection Sort trap: unstable sort when equal keys matter. Neha loses marks for that every viva.

Place Differences between Insertion Sort and Selection Sort next to nearby DSA work — n log n vs n² is the link.

Viva for Differences between Insertion Sort and Selection Sort: what it is → n log n vs n² → the mistake (unstable sort when equal keys matter).

Exam tip

Board: names A→Z. Dry-run Differences between Insertion Sort and Selection Sort. 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]))

Differences between Insertion Sort and Selection Sort — insertion sort grows a sorted prefix by placing each next item correctly.

Short notes

DefDifferences between Insertion Sort and Selection Sort — Neha uses it for names A→Z in the roll list.
RuleDifferences between Insertion Sort and Selection Sort → n log n vs n².
RememberDifferences between Insertion Sort and Selection Sort + time vs memory (the roll list).
UseDifferences between Insertion Sort and Selection Sort in the roll list (names A→Z).
TrapDifferences between Insertion Sort and Selection Sort — unstable sort when equal keys matter.
ExDifferences between Insertion Sort and Selection Sort → 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]))

Differences between Insertion Sort and Selection Sort

Example

Short notes

Questions

Differences between Insertion Sort and Selection Sort

Example

Short notes

Questions