merge sort without extra memory

Question

is there any condition in which merge sort can be done without extra memory my prof said it has and he will give bonus point on that.

Answer 1

You want to google in place merge sort.

Here is one of the result : http://thomas.baudel.name/Visualisation/VisuTri/inplacestablesort.html