Question $8(1$ point$)$

Listen

True or False:

An algorithm for achieving Task T with a complexity O$($nlog$($n$))$ is usually better than an algorithm for $T$ with complexity $O(n^3)$

$$ True

False