In-place merge sort

Does anyone know how to write a in-place merge sort that does not need a temporary array to merge the two halves. I never done this type of programming without using a temporary array.

See this:

https://www.geeksforgeeks.org/in-place-merge-sort/

and try to learn from it...
Topic archived. No new replies allowed.