Which of the following is not in place sorting algorithm by default?ans.insertion sortquick sortheap sortmerge sort Previous Marked for Review Next

The sorting algorithm that is not in-place by default is Merge Sort.

Here's why:

1. Insertion Sort: This is an in-place sorting algorithm because it only requires a constant amount O(1) of additional space.

2. Quick Sort: This is also an in-place sorting algorithm as it sorts the elements directly in the given array and doesn't require any additional space.

3. Heap Sort: Heap sort is an in-place sorting algorithm as it sorts the elements directly in the given array.

4. Merge Sort: This is not an in-place sorting algorithm. It requires additional space proportional to the number of elements being sorted (O(n)), hence it does not sort in-place.

So, the answer is Merge Sort.