# Question: consider two algorithms a1 and a2 that have the running...

###### Question details

Consider two algorithms A_{1} and A_{2} that have
the running times T_{1}(n) and T_{2}(n),
respectively.

T_{1}(n) = 100
nlg(n) and T_{2}(n) =
n^{2}.

Use the definition of O() to show that T_{1}(n) €
O(T_{2}(n))