- Option : D
- Explanation :

I). true

II). false, because recursive programs are use stack

III). true , best and avg O(nlog_{2}n) and worst O(n^{2})

IV). false, because binary search default find mid element O(log_{2}n) when use linear linked list find mid element O(n)

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : A
- Explanation :

For sufficiently large n,

T(n)=Tn−1)+T(n−2)−T(n−3).

If the order of the algorithm for which above recurrence is applicable for the time complexity, is a constant,

T(n)=T(n−1).

⟹T(n)=T(n)+T(n−2)−T(n−3)

⟹T(n−2)=T(n−3)

Going like this, we must have T(1)=T(2)=T(3) which is option A.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : A
- Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.