Consider the problem of computing the range, i.e., the difference between the array's largest and smallest...

 

Transcribed Image Text:

Consider the problem of computing the range, i.e., the difference between the array's largest and smallest elements. a. Design a presorting-based algorithm for solving this problem and determine its efficiency class. b. Compare the efficiency of the algorithms: (i) the brute-force algorithm, and (ii) this presorting-based algorithm. Consider the problem of computing the range, i.e., the difference between the array's largest and smallest elements. a. Design a presorting-based algorithm for solving this problem and determine its efficiency class. b. Compare the efficiency of the algorithms: (i) the brute-force algorithm, and (ii) this presorting-based algorithm.