4. Performance Analysis (Space complexity & Time Complexity)

[@preetidudi6221]

I have a doubt in algorithm 2 and 3 space complexity In algo2 For i,n,s 1 unit each So 3 units And for array n units Then complexity = n+3 units In algo3 For last step that is when n=0 then only if statement will run so the space needed is only for variable n As else statement will not run So space required 3n units for n=n to n=1 and then 1 unit for n=0 Shouldn't the space complexity be 3n+1

[@CSEGURUS]

Of Corse you are right but 1 more memory space required for return 0.0. so it is 3n+2.

[@Lahitha]

@@CSEGURUS i think the answer is 3+n..

[@srivalliammulu3874]

Plzz upload videos all paris shortest path and multistage graph

[@sweetysai3082]

What is the difference of performance analysis and performance measurement?

[@prabhnoorsingh4213]

And it's not "2 into 3" it's "2 race to the power 3"

[@ashtrians]

please add the ppts here it will be great help

[@kurallanagendra1340]

Better u take screenshots..and those screenshots u add to a doucement

[@songlover9437]

In algorithm 3 for time complexity....both "if and else"time is counted?

[@venkatasreeram]

based on the input it will be counted...

[@phuvaneskumar5005]

Why didn't you count the return for space complexity in the first two algorithms?...

[@CSEGURUS]

Yea. we can count but i neglected. why because the value will be carried to the function where it is callled. So we will count the space for return statement in that called function instead here.

[@sreelekhareddy8334]

why u have used 1(n) after taking a(n) in 3rd algorithm can u please explain

[@CSEGURUS]

As it is a recursive algorithm, we need to execute n no.of procedures and for each procedure , memory will be allotted separately so for procedure with parameter value as n, it has to store a[n]--->1 unit, 1(n) means memory required to store n value and 1 for return is required.. This must be applied for all procedures.

[@wownow6780]

I got totally lost in the last 2 algorithms

[@pubggaming5889]

Sir your explanation in recurrence problem time and space complexity is not understandable sir please say slow and neatly your explaining like revision for you sir but not for us 🙂

[@prabhnoorsingh4213]

Try to speak a bit slowly, you usually skip some words!! Otherwise good work👍