I think more true answer is O(n/2logn)


Because outer loop makes n/2 iterations. for (i = n/2; i <= n; i++) from n/2 to n iterations will be.


That’s basically… 1/2*O(nlogn), which becomes c * O(nlogn) and that is O(nlogn)…


yes that’s right and also it is present in option so why would someone select a less accurate answer, doesn’t make sense…