Merge and quick sort are recursive algorithms, needs stack the most.
Well, both selection and insertion are in-place and O(1) space complexity.
Selection sort needs more variables than Insertion sort.
So, According to me, insertion sort should be the answer.