Question

After the recursive sorting step, ____ does not need to combine the sorted sub-arrays.

Answer 1

After the recursive sorting step, merge sort does not need to combine the sorted sub-arrays.

What is merge sort?

Merge sort is an efficient, general-purpose, comparison-based sorting algorithm in computer science.

Most implementations yield a stable sort, which means that the order of equal elements in the input and output is the same.

Merge Sort can be used to sort linked lists. Merge Sort is a stable sort, which means that the same element in an array retains its original position in relation to the others.

Thus, a merge sort does not need to combine the sorted sub-arrays after the recursive sorting step.

For more details regarding a merge sort, visit:

brainly.com/question/13152286?referrer=searchResults

#SPJ4