Consider the following description of two algorithms, A and B, each with the same Big-O. In A's actual growth function there is a larger constant being added than in B's. In B's actual growth function the dominant factor has a larger constant multiplier than in A's. Assume that the functions are alike in every other way. When looking at actual run-times (rather than Big-Oh), is one likely to be better than the other in all circumstances? If so, which? Explain. A. Neither is better than the other in any circumstance, because the two algorithms have the same Big-Oh and will always have exactly the same performance.
B. B is the better algorithm because the larger constant addend in A means that A will always have more overhead than B.
C. A is the better algorithm because the larger constant multiplier in B means that A will always be more efficient than B.
D. None of these is correct.