Question: 1. How many times does the basic operation execute in the code above? a) n b) n + 1 c) log n d) n -

1. How many times does the basic operation execute in the code above?
a) n
b) n + 1
c) log n
d) n - 1

2. For the code above, express the algorithm's order of growth using proper notation.
a) O(n + 1)
b) O(n)
c) O(log n)
d) O(n - 1)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
