Time complexity of CalcSum

#1

How is the time complexity of CalcSum o(n^2) and not o(n) in STL Quiz-II

#2

Hey @akasharora506
Its N^2 because vector is passed by value
So for each recursive call its copied to another vector

So for N calls vector of size N is copied
=> N^2

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.