Topic: Divide And Conquer Problem / Level: beginner

Problem: Use binary search to find the element with the minimum absolute difference with a given number in a sorted array.

Run the code to see the output here...