Suppose You Have Two Different Algorithms for Solving a Problem $n _ { , }$

Short Answer

Suppose you have two different algorithms for solving a problem. To solve a problem of size $n _ { , }$ the first algorithm uses exactly $n \sqrt { n }$ operations and the second algorithm uses exactly $n ^ { 2 }$ log $n$ operations. As $n$ grows, which algorithm uses fewer operations?