Question: The first loop ( while i < n ) has a complexity of O ( log n ) as it doubles i until it exceeds

The first loop (while i < n) has a complexity of O(log n) as it doubles i until it exceeds n.
The second loop (while j >1) has a complexity of O(log m) as it halves j until it is not greater than 1.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!