Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
If the array is already sorted, then the running time for merge sort is: ?
O(n)
O(n*log n)
O(n^2)
O(1)
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!