Let's implement a classic algorithm: binary search on an array.
Implement a class named BinarySearcher that provides one static method named search.
search takes a SearchList as its first parameter and an int as its second.
If the SearchList is null or empty, you should throw an IllegalArgumentException.
SearchList is a provided class. It provides a get(int) method that returns the int at that index, and
a size method that returns the size of the SearchList. Those are the only two methods you should need!
search returns a boolean indicating whether the passed value is located in the sorted SearchList.
To search the sorted SearchList efficiently, implement the following algorithm:
(start + end) / 2)truestart reaches the end, at which point you can give up and
return falseThis is a fun problem! Good luck! Keep in mind that every time you call SearchList.get that counts as one
access, so you'll need to reduce unnecessary accesses to pass the test suite. Specifically, you should only call
list.get once per iteration, saving the result into a temporary variable.
You're challenge is to write tests for this problem described above.
Stuck? You may find these lessons helpful: