For relatively small values of $n,$ algorithms with larger orders can be more efficient than algorithms with smaller orders. Use a graphing calculator or computer to answer this question.

For what values of $n$ is an algorithm that requires $n$ operations more efficient than an algorithm that requires ${|}_{{?}_{?}}50lo{g}_2(n{)}_{{?}_{?}}|$ operations? $($Assume $n$ is an integer such that $n>1.)$

$n$

Need Help?