Question: Write the complexity of the following algorithm in Big-O notation: total = 1; FOR i 1 .. n CONTINUE ELSE total = total + 1
Write the complexity of the following algorithm in Big-O notation: total = 1; FOR i 1 .. n CONTINUE ELSE total = total + 1 END-IF END-FOR Note: to indicate a power use if it is log base 2, just use log if it is a square root, use sqrt
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
