 Such a sort can perform well in practice when combined with a fast stable sequential sort, such as insertion sort, and a fast sequential merge as a base case for merging small arrays.It seems arbitrary to restrict the merge sort algorithms to a binary merge method, since there are usually p > 2 processors available.A better approach may be to use a K-way merge method, a generalization of binary merge, in which formula_7 sorted sequences are merged together.