Walk through the operation of Quick Sort when n = 7 and the input array is (a) Count the number of comparisons in the walk through. (b) Evaluate 7!, lg(7!) and 7lg(7). (c) Construct a best-case...

Walk through the operation of Quick Sort when n = 7 and the input array is

(a) Count the number of comparisons in the walk through.

(b) Evaluate 7!, lg(7!) and 7lg(7).

(c) Construct a best-case example for Quick Sort with n = 15.

The merging problem is as follows: Given two sorted arrays

put these m + n entries into an array C so that

(a) Write a program (or pseudo-code) for the Algorithm Merge. // with 3 array parameters

(b) How many comparisons of array entries would be done in a worst case?

(c) Can A and B be merged into C using

key comparisons in every case?