Time Complexity of Single Loops (Conditional Statement with a Function)

preview_player
Показать описание
Algorithms: Time Complexity of Single Loops (Conditional Statement with a Function)
Topics discussed:
1. Time Complexity of Single Loops - Conditional Statement with a Function.

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

#AlgorithmsByNeso #Algorithms #TimeComplexity
Рекомендации по теме
Комментарии
Автор

Answer :-
1) k = cube root of n, t(n) = theta ( cube root of n )
2) k = 1/2 * log base 2 (n), t(n) = log (n)

parthvgft
Автор

Thank u sir so so much sir i am in 2nd yr soo 😊

satyammishra