// Approach: At every instance one side either right or left is ALWAYS Sorted // Condition to check left side is sorted is arr[start] <= arr[mid] { equals is imp since sometime key present at start == ...

rotate 1 steps to the right: [7,1,2,3,4,5,6] rotate 2 steps to the right: [6,7,1,2,3,4,5] rotate 3 steps to the right: [5,6,7,1,2,3,4] ...