Home Edexcel iGCSE CS Algorithms Searching & Sorting Algorithms Merge Sort


In the algorithm, the list to be sorted is divided into two halves, each of which is then sorted recursively.

One drawback of Merge Sort is that it requires additional space to store the two halves of the array during the recursive splitting process. This space requirement can be reduced through the use of Sort.

One optimization for Merge Sort is to switch to insertion sort for small sub-arrays, as this can reduce the overhead of the merge process. This is known as Sort.

A merge sort algorithm is an algorithm that divides the unsorted list into sublists, each containing one element, and then repeatedly merges sublists to produce larger sorted sublists.

Merge sort is a sorting algorithm.

In Merge Sort, the divide and conquer technique is used to recursively split the array into two halves until only one element remains in each half, then the two halves are for final sorted output.