- Discrete Math
This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!
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
a. f(n) is big-Theta (n^2)
© BrainMass Inc. brainmass.com October 9, 2019, 9:24 pm ad1c9bdddf
b. f(n) is big-Omega (n^3)
c. f(n) is O(n^3)
d. f(n) is O (n log n)
This is a programming exercise that counts the number of times "beep" is executed,