 The allocation of a temporary array can be avoided, but at the expense of speed and programming ease.Various in-place merge algorithms have been devised, sometimes sacrificing the linear-time bound to produce an algorithm; see for discussion.-way merging generalizes binary merging to an arbitrary number of sorted input lists.