a. The algorithm is used to compute the minimum element in

a. The algorithm is used to appraise the reserve atom in the equip A starting from the abjuration p to abjuration r . The variables temp and temp2 are enslaved to the exercise by recursive calls, the equip is disconnected into half until undivided reserve atom is left to be come-backed by the algorithm.

b. The perching relevancy is fond by , T(n) = 2T(n/2)

Take that equip A as 2^{k} elements , and k is an integer , k>=1 , and n= 2^{k}

When k=1 , then n=2 and T(2) = 2.

By applying gathering,

T(2^{k}) = 2^{k}, then 2^{(k+1) =} T(n=2^{(k+1)}) = 2T(2^{k}) = 2 . 2^{k} = 2^{(k+1)}

Since it applies ce k+1 it is as-well applied to complete k,Hence, T(n) = n.