Question is ⇒ The running time of an algorithm T(n),where 'n' is the input size, of a recursive algorithm is given as follows.is given by T(n) =c + T(n - 1), if n > 1 d, if n ≤ 1 The order of this algorithm is, Options are ⇒ (A) n, (B) n+1, (C) n-1, (D) n*1, (E) , Leave your comments or Download question paper.

Question is ⇒ The running time of an algorithm T(n),where 'n' is the input size, of a recursive algorithm is given as follows.is given by T(n) =c + T(n - 1), if n > 1 d, if n ≤ 1 The order of this algorithm is, Options are ⇒ (A) n, (B) n+1, (C) n-1, (D) n*1, (E) , Leave your comments or Download question paper. 1 d, if n ≤ 1 The order of this algorithm is, Options are ⇒ (A) n, (B) n+1, (C) n-1, (D) n*1, (E) , Leave your comments or Download question paper. '/> 1 d, if n ≤ 1 The order of this algorithm is, Options are ⇒ (A) n, (B) n+1, (C) n-1, (D) n*1, (E) , Leave your comments or Download question paper. '/>Previous question Next question


Q1.	The running time of an algorithm T(n),where 'n' is the input size, of a recursive algorithm is given as follows.is given by T(n) =c + T(n - 1), if n > 1 d, if n ≤ 1 The order of this algorithm is
A.	n [Correct Answer]
B.	n+1 [Wrong Answer]
C.	n-1 [Wrong Answer]
D.	n*1 [Wrong Answer]
View Answer 2 -1 Explanation:- Answer : A Discuss it below : !! OOPS Login [Click here] is required to post your answer/result Help other students, write article, leave your comments

Previous question Next question

Also Read Similar Questions Below :