Question

Any algorithm that has a loop (usually 1 to n) will have the time complexity of:

पर्याय

• 1

• N

• N²

• None of these

Answer 1

N

Explanation:

Any algorithm with a loop (often 1 to n) will take N times as long to complete. This is as a result of the loop running N times.