Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences

The solution of the recurrence relation 7(n) = 3T(n/4) + n lg n is

1
θ(n2 lg n)
2
θ(n lg n)
3
θ(n lg n)2
4
θ(n lg lg n)
Share: WhatsApp Telegram X

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