Solving iterative algorithm with 3 nested loops

Solving the efficiency of equation:
for i = 1 to n do
for j = 1 to i do
for k = 1 to j do
x = x + 1

[@MuhammadNadeem-kg1mg]

if i =1 and j=i and k=j then how we analysis ?????

[@WildThoughtsAI]

shit

[@aayushjadhav2743]

if you have say i=1 to n //n+1 times j=1 to i //sigma(j+1) from i=1 to n k=1 to j //sigma(sigma(j+1)) from i= 1 to n and j=1 to i x++ //sigma(sigma(j)) from i=1 to n and j=1 to i

[@guillaume6373]

Thanks for the video, super informative! I would've thought that the term atop the sigma would be n-1, as opposed to n. Is there a convention on whether or not we take n to be inclusive or exclusive?

[@glorysonhorace3265]

Thank you so much.

[@skateboarderlucc]

is this the formal way of determining the exact f(n)? Other tutorials generalize to the dominating term (without using summations) while you use summation to provide us with the exact f(n) function.

[@dustinkenneth338]

Sorry to be off topic but does any of you know of a tool to get back into an Instagram account..? I was stupid forgot my account password. I appreciate any help you can give me

[@tadeokarsyn460]

@Dustin Kenneth Instablaster =)

[@dustinkenneth338]

@Tadeo Karsyn thanks for your reply. I found the site through google and im trying it out atm. I see it takes quite some time so I will reply here later with my results.

[@dustinkenneth338]

@Tadeo Karsyn It worked and I finally got access to my account again. Im so happy! Thank you so much you saved my account!

[@tadeokarsyn460]

@Dustin Kenneth no problem :)