Given an array $A[p..r],$ the following recursive algorithm Min$(A,p,r)$ will return

the smallest element in A$[$p$..$r$].$ The algorithm recursively divide the input array into

two subarrays and compare the minimums of the two subarrays to find the smallest

element of the original array $A[p..r].$

Min$(A,p,r)$

if $p=r$

return $A[p]$

else

$q=\frac{p+r}{2}$

$a=$Min$(A,p,q)$

$b=$Min$(A,q+1,r)$

if Min$(A,1,6)Min(A,1,3)$

Min$(A,5,6)$

Min$(A,4,5)$

Min$(A,2,2)$