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
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
