New Enroll here to Join NaBFID Analyst Into Class on May 6

    Question

    Running time T(n) where 'n' is the input size of the

    recursive algorithm given as : T(n) = c + T(n-1), if n > 1 ; T(n) = d if n < 1. The order of the algorithm is
    A n^2 Correct Answer Incorrect Answer
    B n Correct Answer Incorrect Answer
    C n^3 Correct Answer Incorrect Answer
    D n^n Correct Answer Incorrect Answer

    Solution

    The running time T(n) where ‘n' is the input size.

    Practice Next

    Relevant for Exams: