Sorting Flashcards
1
Q
Master theorum for T(n) = aT(n/b) + f(n)
A
if f(n) = theta(n^d), where d >= 0,
T(n) = theta(n^d) if a < b^d
T(n) = theta(n^d logn) if a = b^d
T(n) = theta(n^log b a) if a > b^d
Data Structures and Algorithms > Sorting > Flashcards
Master theorum for T(n) = aT(n/b) + f(n)
if f(n) = theta(n^d), where d >= 0,
T(n) = theta(n^d) if a < b^d
T(n) = theta(n^d logn) if a = b^d
T(n) = theta(n^log b a) if a > b^d