complexity for recursion function

Question

I have written a function for reverse a stack inline. these two are member function of stack class .

void reverse()
{
    int first=pop();
    if(first!=-1)
    {
        reverse();
        insert(first);
    }
}
private:
void insert(int i)
{
    int temp=pop();

    if(temp==-1)
    {
       push(i);     
    }
    else
    { 
       /* there is already a element in the stack*/
       insert(i);
       push(temp);

    }
}

Now how can i analyze my function in form of big O to calculate complexity.

rnbguy · Accepted Answer · 2013-07-20 08:19:19Z

1

Your insert() takes O(length of the stack) time because:

T(n) = T(n-1) + O(1)[to push] = O(n)

and your reverse() takes O(square of the length of the stack) time because:

T(n) = T(n-1) + O(n)[for insert] = O(n^2)

answered Jul 20, 2013 at 8:19

rnbguy

1,3992 gold badges12 silver badges29 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

complexity for recursion function

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related