Algorithms Asymptotic Worst Case Time and Time Complexity Introduction

The running time of an algorithm T(n), where ‘n’ is the input size, is given by

T(n) = 8T (n/2) + qn, if n > 1

        = p,           if n = 1

Where p, q are constants. The order of this algorithm is

1
n2
2
nn
3
n3
4
n

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