You are asked to compare two proposed algorithms for sorting an array of integers.

(a) What measures would you consider using as a basis for comparing the two sorting algorithms

and why?

(b) Explain the terms best case, worst case and average case and how the terms help compare

performance of the two algorithms, specifically using the run-time measure.