401 data structures and algorithms code challenges
Write a function called BinarySearch which takes in 2 parameters: a sorted array and the search key. Without utilizing any of the built-in methods available to your language, return the index of the array’s element that is equal to the value of the search key, or -1 if the element is not in the array.
I had a hard time thinking of a way to split the list that worked for even or odd lists.