Which of the below sorting algorithms are not done in in-place? (in-place means doing sorting in the same array and not taking extra array or taking too much of extra space).
We can do insertion sort, selection sort, and quick sort with in the same array. But merge sort requires extra amount of space to do the sorting compared to other 3 sorting techniques.
Back To Top