The number of operations executed by algorithms A and B is 8nlogn and 2n2,respectively. Determine n0 such that A is better than B for n ≥ n0.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.