Topic: Divide And Conquer Problem / Level: beginner

Problem: Implement binary search to find the number of elements smaller than a given value in a rotated sorted array.

Run the code to see the output here...