BINARY SEARCH
+========+
Time: 30 minutes
Difficulty: Easy
Languages: Any
+========+
Given a sorted list of integers, implement a function that performs a binary search on the list and returns the index of the element if found or -1 if not found
+========+
Please answer to this message with your solution 🙂
>>Click here to continue<<