Revision history [back]

The process of combining two arrays that are already sorted is called merge operation. Here is the step-by-step process:

1. Initialize two pointers, one for each array (let's call them A and B).
2. Compare the elements at the current index of both arrays.
3. Append the smaller element to a new array (let's call it C) and move the pointer of the array it came from to the next index.
4. Repeat steps 2 and 3 until both pointers have reached the end of their respective arrays.
5. Copy any remaining elements from the remaining array to the end of array C.
6. Array C now contains the merged and sorted array.