Find Minimum in Rotated Sorted Array

This problem is part of solulu Pro

A sorted array of distinct integers was rotated some number of times: [0, 1, 2, 4, 5, 6, 7] might become [4, 5, 6, 7, 0, 1, 2]. Return the minimum element in O(log n) time.