nlogn vs square root of n , Isn't square root slower?
<p>I was doing this quiz on an online course and one question stated;</p>

<p>The function nlogn + √n + 5 may set to belong to<br/>
A:  nlogn<br/>
B:  √n<br/>
C:  n√n<br/></p>

<p>The quiz said the correct answer is A, but isn't square root of n slower? I am new to finding the time complexity of an algorithm and could use an explanation. Or let me know if the answer is wrong.</p>