Running time of an algorithm T(n), where ‘n’ is input size, is given by T(n) =…

Running time of an algorithm T(n), where ‘n’ is input size, is given by T(n) = sqrt(16)T(n/2) +2n The algorithm’s order of Θ notation is:

  1. A.

    Θ(2n)

  2. B.

    Θ(n (3log n) *log n )

  3. C.

    Θ(n2)

  4. D.

    None of the above

Attempted by 207 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…