# Big-O Big-Theta

Given the algorithm below, suppose the number of times the "beep" instruction is executed is f(n). Choose all true statements below, and no false ones...

for i := 1 to n

for j : = 1 to i

for k := 1 to 18

BEEP

next k

next j

next i

a. f(n) is big-Theta (n^2)

b. f(n) is big-Omega (n^3)

c. f(n) is O(n^3)

d. f(n) is O (n log n)

https://brainmass.com/math/discrete-math/big-big-theta-183493

#### Solution Summary

This is a programming exercise that counts the number of times "beep" is executed,

$2.19