Top
/
Cost of algorithms
/
Examples
/
Answer-analysis-1
Answer to Question analysis-1
It goes around the loop n times. Each time around, it does at most a fixed amount of work. So the total time is Θ(
n
).