The K-Way Merge Algorithm is an enhancement of the basic two-way merge in which not just two but several sorted arrays are merged in one. It consists of cutting the array in half recursively, joining each two halves until one sorted array is left. This is usually accomplished in a Divide and Conquer fashion.