1. Use the results in problems 3.1 and 3.2 to draw conclusions about the running time and number of comparators needed by the (n, n) odd-even merging network of section 3.2. 2. Show that, in general,...

1. Use the results in problems 3.1 and 3.2 to draw conclusions about the running time and number of comparators needed by the (n, n) odd-even merging network of section 3.2.

2. Show that, in general, any (r, s)-merging network must require 12(s log r) comparators when r

May 26, 2022