Question :
Suppose you are comparing two algorithms A and B that run on the same machine.
The running time of A is 10n log2 n and the running time of B is 50n (assume these are exact running time).
What is the smallest value of n such that B runs faster than A on inputs of size n?