Doubt on sorting technique

#1

in the following problem a inplace O(nlogn) sorting algorithm is used…is this technique a good practice to use anywhere. And why dont we study this technique as standard sorting techniques?

problem: https://www.geeksforgeeks.org/efficiently-merging-two-sorted-arrays-with-o1-extra-space-and-onlogn-mlogm/?ref=rp

#2

hello @aman17nov1999
its a merging algorithm only (i.e it is used for merging two sorted array).

we have better technique as well , that merge array in O(n) (refer merge algorithm of mergesort)

#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.