Aspire Faculty ID #17692 · Topic: JECA MCA 2025 · Just now
JECA MCA 2025

The running time T(n) of an algorithm is given as follows: T(n)=c+T(n-1), if n>1 and =d if n≤1. Here c and d are constants.

Solution

Linear recurrence → T(n)=O(n).

Previous 10 Questions — JECA MCA 2025

Nearest first

Next 10 Questions — JECA MCA 2025

Ascending by ID
Ask Your Question or Put Your Review.

loading...