Problem
Let be an A vector of n integers. It is possible to determine the position of the smallest vector element in T(n) by traversing the vector elements in an iterative way. Alternatively, a division-and-conquer method may be used. Make a function to determine the position of the smallest vector element. The algorithm must recursively divide the vector into two parts of approximately equal lengths until a trivial case is reached. Determine and solve the recurrence equation for your algorithm. Is the recursive algorithm more efficient than the iterative algorithm?