Question: Find the big-O complexity of the following algorithm (and explain why): for(int i=1; i
Find the big-O complexity of the following algorithm (and explain why):
for(int i=1; i<= log n; i=i*2)
cout << "Hello";
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
