Breaking News: Grepper is joining You.com. Read the official announcement!

Time complexity in recursion

Motionless Macaw answered on July 18, 2021 Popularity 10/10 Helpfulness 2/10

answer Time complexity in recursion

related how to calculate the time complexity of a recursive function

Time complexity in recursion

Comment

void recursiveFun4(int n, int m, int o)
{
    if (n <= 0)
    {
        printf("%d, %d\n",m, o);
    }
    else
    {
        recursiveFun4(n-1, m+1, o);
        recursiveFun4(n-1, m, o+1);
    }
}
Here, it's O(2^n), or exponential, since each function call calls itself twice unless it has been recursed n times.

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: stackoverflow.com

Tags: recursion time-complexity whatever

Link to this answer
Share Copy Link

Contributed on Jul 18 2021

Motionless Macaw

0 Answers Avg Quality 2/10

Closely Related Answers

how to calculate the time complexity of a recursive function

Comment

Time complexity of a recursive function depends on the number of times the 
function is calling himself multiply this by the each time how many time 
complexity is taken on each call it can be O(1), O(log n), O(n) or more. 

Let's say our function is calling n-1 times and each it is doing some 
comparisons and call it self again. So function itself has a time complexity of
O(1). 
So the total time complexity will be (n-1)*1 which is o(N).

Popularity 10/10 Helpfulness 4/10 Language javascript

Source: Grepper

Tags: function functio

Link to this answer
Share Copy Link

Contributed on Apr 28 2022

Coding is fun

0 Answers Avg Quality 2/10

Time complexity in recursion

Contents

More Related Answers

Time complexity in recursion

Closely Related Answers

how to calculate the time complexity of a recursive function

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.