Simplified stable merging tasks

Dewar, 1974, A stable minimum storage algorithm, Inform. Process. Lett., 2, 162, 10.1016/0020-0190(74)90004-0 Dudzinski, 1981, On a stable minimum storage merging algorithm, Inform. Process. Lett., 12, 5, 10.1016/0020-0190(81)90065-X Horvath, 1978, Stable sorting in asymptotically optimal time and extra space, J. Assoc. Comput. Mach., 25, 177, 10.1145/322063.322064 Huang, 1986 Knuth, 1971, Mathematical analysis of algorithms, 19 Knuth, 1973, Vol. III Kronrod, 1969, Optimal ordering algorithm without operational field, Soviet Math. Dokl., 10, 744 Macleod, 1970, An algorithm for in-situ permutation, Austral. Comput. J., 2, 16 Mannila, 1984, A simple linear-time algorithm for in situ merging, Inform. Process. Lett., 18, 203, 10.1016/0020-0190(84)90112-1 Preparata, 1975, A fast stable sorting algorithm with absolutely minimal storage, Theoret. Comput. Sci., 1, 185, 10.1016/0304-3975(75)90019-5 Reed, 1985 Rivest, 1973 Santoro, 1985, On the unmerging problem, SIGACT News, 17, 5, 10.1145/382250.382251 Schaffer, 1985, Letter to the Editor, SIGACT News, 17 Salowe, 1985 Trabb Pardo, 1977, Stable sorting and merging with optimal space and time bounds, SIAM J. Comput., 6, 351, 10.1137/0206025 Wong, 1981, Some simple in-place merging algorithms, Bit, 21, 157, 10.1007/BF01933160