what actually mergesort(a,s,mid) or mergesort(a,mid-1,e) do actually what happened in this
About recursion call function
hey Ravi mergesort(a,s,mid) and mergesort(a,mid+1,e) sorts the array from s to mid and from mid+1 to e respectively. Now what you have is an array consisting of two sorted parts! Now the total sorted array will be simply like merging these two sorted parts which done by another call merge(s,mid+1,e)
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.
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.