Question: Exercise (Mysterious Divide-and-Conquer) Consider the following divide-and-conquer algorithm MYSTERY, which takes as input an integer array A of length n. The procedure CONCAT concatenates two

Exercise (Mysterious Divide-and-Conquer) Consider the following divide-and-conquer algorithm MYSTERY, which takes as input an integer array A of length n. The procedure CONCAT concatenates two given arrays in linear time. 1:2:3:4:5:6:7:8:9:procedureMYSTERY(A[1n]):ifn1thenreturnfalseifn=2thenifA[1]=A[2]thenreturntrueelsereturnfalseSplitAintothreesubarraysA1,A2,A3oflengths3n,3n,n23nB1:=CONCAT(A1,A2)B2:=CONCAT(A1,A3)B3:=CONCAT(A2,A3)returnMYSTERY(B1)MYSTERY(B2)MYSTERY(B3) a. Find out what MYSTERY (A) computes and formally prove your claim. b. Use the Master theorem to analyze the running time of the algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
