Recall the following algorithm to find maximum in an array A: Maximum (A) n = A....

 

Transcribed Image Text:

Recall the following algorithm to find maximum in an array A: Maximum (A) n = A. length max = A [1] for i = 2 to n { } if max <A[i] { A[i] } max = return max Assume that size of the input array A is even, i.e., A.length = n = 2k for a positive non-zero integer k. Recall that we discussed how to reduce the number of comparisons to find maximum and minimum simultaneously. (a) Give a pseudocode to find maximum and minimum simultaneously. (10 pt) (b) Explain the number of required comparisons (it should be less than 2n - 2). (10 pt) Recall the following algorithm to find maximum in an array A: Maximum (A) n = A. length max = A [1] for i = 2 to n { } if max <A[i] { A[i] } max = return max Assume that size of the input array A is even, i.e., A.length = n = 2k for a positive non-zero integer k. Recall that we discussed how to reduce the number of comparisons to find maximum and minimum simultaneously. (a) Give a pseudocode to find maximum and minimum simultaneously. (10 pt) (b) Explain the number of required comparisons (it should be less than 2n - 2). (10 pt)

Answer rating: 100% (QA)

Heres the pseudocode to find the maximum and minimum simult... View the full answer