Question: My friend said she discovered a new efficient algorithm AVERR to calculate the average value AVERR to calculate the average value of a list of
My friend said she discovered a new efficient algorithm AVERR to calculate the average value AVERR to calculate the average value of a list of n distinct integers. Which of the following statements about the AVERR must be false.
a. The worst case running time is O(n^2)
b. The best case running time is Theta(lgn)
c. The worst case running time is Omega(logn)
d. The average case running time is O(n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
