Is square root of n closer to O(log n) or O(n)?
<p>I have two algorithms A and B.</p>

<p>Time complexity of algorithm A is <em>O</em>(log <em>n)</em> and that of B is <em>O</em>(<em>n</em>).</p>

<p>Now I have a new algorithm C that has time complexity of <em>O</em>(&radic;<em>n</em>) I need to prove (mathematically) whether algorithm A or algorithm B is asymptotically closer to algorithm C.</p>

<p>Any help on this is well appreciated. Thanks!</p>