Topic: Divide And Conquer Problem / Level: beginner

Problem: Use binary search to find the smallest element greater than or equal to a given number in a rotated sorted array.

Run the code to see the output here...