Which of the following is not in place sorting algorithm by default?ans.merge sortheap sortquick sortinsertion sort

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

Here's why:

1. In-place sorting means the algorithm sorts the list of items directly on the original array, without requiring extra space for a temporary array.

2. Merge Sort, by default, is not an in-place sorting algorithm. It requires extra space proportional to the array size to store the auxiliary arrays used during the merge process.

3. On the other hand, Heap Sort, Quick Sort, and Insertion Sort are all in-place sorting algorithms as they do not require additional space proportional to the size of the input and they rearrange elements within the array to sort the items.