MergeSort Recursion problem

#1

Not passing any test cases.Problem to understanding constraint.

here ise my code:

#2

Hey @coder_girl
In merge,creste temp dynamically of size end -start+1
And start k from 0
due to above changes While copying back from tmp to a
A[i] = temp[i-start]

We are dong this because we have only limited memory in stack and for each recursion call u are making an array of 2000000… some size

Here I updated ur code

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.