Time Complexity of Single Loops (Update Expression with Power)

Algorithms: Time Complexity of Single Loops (Update Expression with Power)
Topics discussed:
1. Time Complexity of Single Loops - Update Expression with Power.

Music:
Axol x Alex Skrindo - You [NCS Release]

#AlgorithmsByNeso #Algorithms #TimeComplexity

[kajalshukla]

Extremely Quality lecture ❤❤❤, your hardwork is clearly visible in your lecture content ❤❤❤

[WisdomWave-gl]

Home work problem solution - > loop will run ->>log base 2.5 log base 1 (n)
+1 times
2) log base 3 log base 1 (n) +1 times and time complexity of both question O(log log n)

[AbdulRahman-ypoy]

Excellent
But dear please make a course on Software engineering

[parthvgft]

Answer
1) K = [ log 5/2 log (n) ]

2) K = [ log 3 log (n) ]

[safar]

"Sir, will you be giving a lecture on the time complexity of multiple loops?" 😊

[neelampanwar]

Why did you take complexity in theta notation? Why not in big o?

[AreebaRiaz-ju]

Can you please share answers for homework

[mani_ma]

Isn't the first one goes infinite loop ?, anything power 1, stands at 1