Körtidsanalys av Insertion Sort, logaritmer, binärsökning, rekursion. DSA 2026 föreläsning 5.

Name: Körtidsanalys av Insertion Sort, logaritmer, binärsökning, rekursion. DSA 2026 föreläsning 5.
Uploaded: 2026-04-15T00:00:00.000Z
Duration: 1 h 26 min 3 s
Description: Insertion sort runs in linear time (5n − 4 operations) when the input is already sorted and in quadratic time otherwise. Binary search on a sorted array finds an element in about log₂ n steps, so 384 billion elements...

Thomas Padron-McCarthy · 86:03

Insertion sort runs in linear time (5n − 4 operations) when the input is already sorted and in quadratic time otherwise. Binary search on a sorted array finds an element in about log₂ n steps, so 384 billion elements...

Read the full summary on tuber