Topic: Divide And Conquer Problem / Level: beginner

Problem: Implement binary search to solve the problem of finding the smallest number in a rotated unsorted matrix.

Run the code to see the output here...