INSTRUCTIONS
Binary Search
Binary Search is a famous searching algorithm.
It uses Divide and Conquer to search the elements.
The Array should be sorted.
Worst - Case Complexity : O(log n)
Average - Case Complexity : O( log n)
Best - case Complexity :O(1)