is not in place sorting algorithm by default?

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

Here's why:

1. Definition: An in-place sorting algorithm uses constant extra space for producing the output (sorts the numbers internally).

2. Merge Sort: Merge sort is a divide and conquer algorithm that divides the input array into two halves, calls itself for the two halves, and then merges the two sorted halves.

3. Extra Space: The merge process in merge sort requires extra space for the left and right halves of the array, which means it does not sort the input array internally.

4. Therefore, by default, merge sort is not an in-place sorting algorithm.

Note: There are variations of Merge Sort that are in-place, but they are not the default or most common implementations.