1/6
Info2 FS2026
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
T(n) = a * T(n/b) + f(n)
f(n) = O( nlogb(a) - ε )
T(n) = Θ( nlogb(a) )
T(n) = a⋅T(n/b) + f(n)
f(n) = Θ( nlogb(a) )
T(n) = Θ( nlogb(a) ⋅ logb(n) )
T(n) = a⋅T(n/b) + f(n)
f(n) = O( nlogb(a) + ε )
a⋅f(n/b) ≤ c⋅f(n) for some c ∈ (0,1)
T(n) = Θ( f(n) )
MergeSort
Θ( n⋅log2(n) )
HeapSort
Θ( n⋅log2(n) )
QuickSort
Worst: Θ( n2 )
Best: Θ( n⋅log2(n) )
Bubble, Selection, InsertionSort
Θ( n2 )