Question:
Software Algorithms and Implementation
Give the order of each of the following functions.
TA(n) = 200(n +4)3
TB(n)= n4 + 300n3log2(n)
TC(n)=(2n +3)2log3(n)
Suppose that each is the time efficiency function of an implementation of the same function (TA(n) for implementation A, and so on). Which of the implementations (A, B or C) will be the most efficient for very large values of n? Please explain.