Consider the recurrence relation : \(\begin{array}{} T(n)& =8T \bigg(…

UGC NET 2017

Consider the recurrence relation :

T(n)=8T(n2)+Cn,if n>1=b,if n=1\begin{array}{} T(n)& =8T \bigg( \dfrac{n}{2} \bigg) + Cn, \text{if } n>1 \\ & =b, \text{if } n=1 \end{array}

Where b and c are constants. The order of the algorithm corresponding to above recurrence relation is :

  1. A.

    nn

  2. B.

    n2n^2

  3. C.

    nlg⁡nn \lg n

  4. D.

    n3n^3

Attempted by 326 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…