engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences

Solve the following recurrence relation:

T(n) = 3T(n/2) + n2

1
θ(n2) 
2
θ(n) 
3
θ(n×log2 n) 
4
θ(log2n) 
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