How do you implement binary search on a rotated sorted array?

Question Explain

Binary search on a rotated array requires modifications to handle the pivot point where the order breaks.