'Number of comparisons Merge Sort of unknown size array

Given an array of n distinct numbers, where n = 2^k, how do I find and prove the minimum and maximum number of comparisons?

The comparisons would be between the distinct elements.

I have seen some questions on SO but doesn't seem to match what I'm looking for.

algorithmsortingmergesortrecurrence


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions