Compute The Time Complexity Of The Following Code

Compute the complexity of the following code fragment.

Easy Algorithm Analysis Tutorial:
https://www.udemy.com/algorithm-analy...

Recurrence Relation Tutorial:
https://www.udemy.com/recurrence-rela...


Please subscribe !

Here is an example where you might think the answer should be log n according to the rule of thumb for multiplication/division in loops:
   • Time Complexity Example  

Here is a pretty simple video on time complexity resulting in O(n):
   • Complexity Of Programs  

Here is an example of a recurrence relation resulting in O(log n):
   • Recurrence Relations Examples  

Here is a playlist of what I have on algorithm analysis so far:
   • Algorithm Analysis (Time Complexity)  

►Website: http://everythingcomputerscience.com/

►Support this channel on Patreon:   / randerson112358  

►Discrete Mathematics Workbooks:
(1) Practice Problems in Mathematics - https://www.amazon.com/gp/product/013...

(2)Discrete Mathematics Workbook - https://www.amazon.com/gp/product/013...