Algorithm Analysis and Summation Notation

[@hanook75]

Hi. Thank you for your excellent explanation. It helps me a lot however i've got problem finding examples of evaluating sums by perturbation method. Could you make a few examples explaining it the way you do?

[@satchua7367]

Its series sum formula, sum from i=1 to n = n(i + n)/2

[@samuwall]

Great video. Is it always possible to calculate big O runtime by just solving the sum and looking at the highest exponent?

[@rictatorship0259]

Yeah, the largest term is all that matters for big O or big theta questions, because that term is what changes the order of growth the most

[@youtubestar1525]

Nice and easy explanation . 👌

[@lakoper9541]

why is it O(n^4)? can you explain please?

[@vitortheone]

if you still don't have the answer: --- because in bigO notation you consider the worst case, in example 3n^4 > 3n^2, then O(n^4)

[@nisaragbhatt1098]

What do you do if you have for example for(int i=1; i

[@areejturkei5482]

O(n^2 log n^2)

[@mayamalla2554]

Thank uuuuuu

[@alexandresobral2009]

Very Thanks

[@randerson112358]

Thank you!

[@adityachaudari4321]

your all videos sounds on only one side of earphone.

[@flynneugene2675]

Don't use earphones😂😂

[@jdarrrr]

If this video was any more yellow I'd think I'm watching the Simpsons

[@randerson112358]

😆 😂 😆

[@randerson112358]

😄 🤣 😂

[@jdarrrr]

@@randerson112358 great video though man 😂

[@ajm6456]

Thanks boss!

[@randerson112358]

Thanks for watching AJ !

[@fatmaghorbel6579]

hey I have this algorithm and I need to calculate it's complexity, could you do it for me ? Im confused about i*i cauz usually we use i so ..... function(int n) i