Please help me with this algorithm question...please?

Write a divide-and-conquer algorithm to find the minimum value in an array of integers. It should run in time 0(n), where n is the length of the array.