Algorithm Analysis and Summation Notation

Algorithm analysis practice

Online Lesson For Algorithm Analysis:

[hanook]

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?

[satchua]

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?

[nisaragbhatt]

What do you do if you have for example

for(int i=1; i <= n*n; i+=2)
for(int j=1; j <= i; j = j/2)

Like the incrementing part is not i++ but its a multiplication or division? Is it possible to use series analysis to ffind the run time?

[lakoper]

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

[adityachaudari]

your all videos sounds on only one side of earphone.

[fatmaghorbel]

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 <-2
while i*i <= n do
if n%i==0 then
return false
end if
i <- i+1
end while
return true