(adsbygoogle = window.adsbygoogle || []).push({}); Combinatorics....evil problem!!

Hi all,

I am working on my combinatorics homework. I have completed all of the problems but one. Here it goes:

------------------------------------------

Let S_1 and S_2 be two sets where |S_1| = m and |S_2| = r, for m,r in Z+ (positive integers), and the elements in each of S_1, S_2 are in ascending order. It can be shown that the elements in S_1 and S_2 can be merged into ascending order by making no more than m + r - 1 comparisons. Use this result to establish the following:

For n >= 0, Let S be a set with |S| = 2^n. Prove that the number of comparisons needed to place the elements of S in ascending order is bounded above by n * 2^n.

------------------------------------------

Please help!!!! Due by 12:00 PM EST tomorrow the 3rd!!

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Combinatorics evil problem

**Physics Forums | Science Articles, Homework Help, Discussion**