Question: Prove that if an algorithm is (f(n)) in the average case, then it is O(f(n)) in the best case.
Prove that if an algorithm is Θ(f(n)) in the average case, then it is O(f(n)) in the best case.
Step by Step Solution
3.45 Rating (165 Votes )
There are 3 Steps involved in it
The statement that if an algorithm is fn in the average case then it is Ofn in the best case is not necessarily true There are cases where an algorith... View full answer
Get step-by-step solutions from verified subject matter experts
