Which of the following sorting algorithms is described by this text? "Split the array in two parts. Take each part, and split it into two parts. Repeat this process until each part has only two items. Check the order of the two items and swap if necessary. Then, take the sorted part and combine it with an adjacent part, sorting as you combine. Repeat until all parts have been combined."

A) Insertion sort

B) Merge sort

C) Heap sort

D) Quick sort

E) Selection sort

Option (B) i. e "Merge sort " is the correct answer to the given question.

Explanation:

The merge sort follow the approach of divide and conquer technique. It means firstly it divided the given array into the sub parts that sub parts are sorted in comparing the first value with the adjacent value and perform selection sorting in them it means we swap the value if necessary. This process will continue until all the elements are checked.

When the sub parts are arranged then we will combine them and getting the new or original array that is in sorted order. When we perform the merge sort the extra memory is used which is drawback of merge sort. All the other options are not Splitting the array in two parts and perform sorting so these are incorrect option.