Algorithms Asymptotic Worst Case Time and Time Complexity Introduction

The recurrence relation T(n) = 7T(n/7) + n has the solution:

1
O(n)
2
O(logn)
3
O(nlog(n))
4
O(n2)

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