Question: f the running time function of an algorithm is O ( g ( n ) ) , then the best g ( n ) is
f the running time function of an algorithm is Ogn then the best gn is
The average of the largest gn and the smallest gn
The largest gn
The smallest gn
None of the mentioned
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
