Solution: Find Minimum in Rotated Sorted Array

Statement

You’re given a rotated sorted array, arr, of length $n$, that is rotated clockwise between $1$ and $n$ times.

For example,

• Before rotation, arr $= [1,2,3,4,5,6,7,8]$ ...