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 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 Differences between Insertion Sort and Selection Sort.

From the example next to this theory: Differences between Insertion Sort and Selection Sort — insertion sort grows a sorted prefix by placing each next item correctly.

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

Viva — what is Differences between Insertion Sort and Selection Sort? Then show n log n vs n². Then name the trap.

Exam tip

What is Differences between Insertion Sort and Selection Sort? Show this: n log n vs n². 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 — names A→Z in the roll list.
Rulen log n vs n²
Trapunstable sort when equal keys matter
Usethe roll list

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