New-Merge(rl], tmpL], 1b, mid, ub): // assume tmpLl stores sorted subarrays J mid+1 for mlb to ub if (i > mid) r [m] tmp [j++] else if (j ub) r[m] tmp [i++] else if (tmp [j] tmp [1]) r[m] tmp[j++] else r[m] tmp[i++] The following routine is an attempt to use the New-Merge routine. (Here, sorted and merged are used to store the addresses of arrays r [] and tmp []. The addresses are exchanged in the outer while-loop after each iteration.) Iter-Mergesort (r C], n): // assume auxiliary space tmp[] sorted r; // r[] contains sorted 1-element subarrays merged mid) r [m] tmp [j++] else if (j ub) r[m] tmp [i++] else if (tmp [j] tmp [1]) r[m] tmp[j++] else r[m] tmp[i++] The following routine is an attempt to use the New-Merge routine. (Here, sorted and merged are used to store the addresses of arrays r [] and tmp []. The addresses are exchanged in the outer while-loop after each iteration.) Iter-Mergesort (r C], n): // assume auxiliary space tmp[] sorted r; // r[] contains sorted 1-element subarrays merged