Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences

Which of the following functions, given by their recurrences, grows the fastest asymptotically?

1
T(n) = 8 T(n/4) + 100n2
2
T(n) = 81T(n/9) + 10n2
3
T(n) = 16T(n/4) + 100(nlogn)1.99
4
T(n) = 100T(n/100) + nlog2n

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters