Design A Divide And Conquer Algorithm Which Takes As Input An Unsorted Array Of

Design a divide-and-conquer algorithm which takes as input an unsorted array of

n distinct numbers and returns the index of the smallest number in the array.

Provide an English explanation of the algorithm followed by pseudocode. Set up a

recurrence relation for the running time of your algorithm, and prove the -bound

on the running time via a proof by induction.

Posted in Uncategorized