Topic: Divide And Conquer Problem / Level: beginner

Problem: Use divide and conquer to solve the problem of finding the largest element smaller than a given number in a rotated sorted array.

Run the code to see the output here...