Prove worst-case lower bound (counting comparisons) for sorting 5 elements.

I have already answered it but i dont know whether i did it correctly. Basically, what i did is, i have proved that ANY comparison-based algorithm will have lower bound Omega(nlgn). HOWEVER, i have not taken into account the 5 elements that appear in the question since i have no idea how that fits.

So, my question is: by proving that any comparison-based algorithm has worst case lower bound Omega(nlgn) do i answer this question?

This post has been edited by **darek9576**: 09 February 2012 - 09:26 PM