I know that in the worst case the merge sort algorithm takes theta(n lg n) to complete.

I know that when sorting an array of size 6 the maximum number of comparisons required is 11.

How can I figure the minimum number of comparisons to sort an array of size 6?

pwr