Algorithms Asymptotic Worst Case Time and Time Complexity Introduction

The solution of the recurrence relation T(m) = T( 3m/ 4) + 1 is:

1
θ (lg m)
2
θ (m)
3
θ (mlg m) 
4
θ (lglg m)

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