create a Binary Search ADT that implements insertion and search called SortedArray. The SortedArray class, which implements a sorted, one-dimensional array of NHL players and supports binary search, has the following public methods: the SortedArray() constructor, IsEmpty(), Insert() and Find(). You may choose to implement SortedArray as a generic class – if so, the signatures of the various methods will differ.
The public methods of SortedArray() have the following signatures:
public SortedArray(int maxN)
public bool IsEmpty()
public Player Find(Player arg)
Note that this would be
public T Find(T arg)
if you implemented a generic implementation of SortedArray. Note that the argument to Find() is not merely an integer value.
public void Insert(Player arg)
public void Insert(T arg)
if you followed the generic implementation of SortedArray.
You may NOT change the class name or the signatures of any of these methods in your submission.
You will use each player’s jersey number as the value with which to sort and lookup individual players. For the purposes of this assignment, you may safely assume that all jersey numbers are unique (and you may refrain from using duplicate jersey numbers with your test data). If you choose to implement a generic implementation of SortedArray, then you may only use the CompareTo() method of the Player class with which to compare one Player to another.