A CPP program to find the minimum element from a rotated sorted array. For example,
{0,1,2,3,4,5,6} might become {4,5,6,0,1,2,3} after rotating from a pivot index unknown to us.
We need to find the minimum element from the latter array using O(log n) approach.
A CPP program to find the minimum element from a rotated sorted array. For example, {0,1,2,3,4,5,6} might become {4,5,6,0,1,2,3} after rotating from a pivot index unknown to us. We need to find the minimum element from the latter array using O(log n) approach.