πŸ“’ Too many exams? Don’t know which one suits you best? Book Your Free Expert πŸ‘‰ call Now!

  • google app store apple app store
  • βœ–

      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
      More IT Networking Questions

      Relevant for Exams:

      ask-question