Suppose you are given a sequence or array of n real numbers (a1, a2, . . . , an), all distinct. We are interested in sorting this list, and ideally sorting it as efficiently as possible / with minimal effort. All information relevant to sorting a list can be thought of as contained in the order permutation. If a list (a1, a2, a3) has an ordering permutation of (3, 1, 2), that would mean a3 ≤ a1 ≤ a2, hence, the sorted form of the list would be (a3, a1, a2). This permutation encodes how all the elements compare to one another. 

1) How many possible ways could a list of n values be ordered, i.e., how many ordering permutations are there? 

2) Argue that if you know a list’s order permutation, sorting is easy (linear time), and conversely, if you know the steps to sort the list, you can easily generate the order permutation. 

3) Given this, argue that sorting can’t be easier than finding the order permutation. 

4) If every element comparison (testing where ai ≤ aj ) provides at most one bit of information, argue that in order to be able to sort any list, you need to perform at least approximately log2(n!) many comparisons.

 5) Based on the prior result, argue that merge sort is, asymptotically, as or more efficient than any other sorting algorithm.

Answer rating: 100% (QA)

The given array of n re... View the full answer