2. a. Write a pseudocode for a divide-and-conquer algorithm for finding values

of both the largest and smallest elements in an array of n numbers.

b. Set up and solve (for n = 2k) a recurrence relation for the number

of key comparisons made by your algorithm.

c. How does this algorithm compare with the brute-force algorithm for

this problem?

3. a. Write a pseudocode for a divide-and-conquer algorithm for the exponentiation

problem of computing an where a > 0 and n is a positive

integer.

b. Set up and solve a recurrence relation for the number of multiplications

made by this algorithm.

c. How does this algorithm compare with the brute-force algorithm for

this problem?

    • 8 years ago
    Answer in detail
    NOT RATED

    Purchase the answer to view it

    blurred-text
    • attachment
      answer.docx