Your job is complete the add ( ) method in the OrderedList class such that this list implements an ordered list of elements added. No matter where you add the object, it will always be inserted in the correct order, according to calls to compareTo. Complete the public boolean add(E it) method as described below. It uses the compareTo () defined in E (via Comparable) to find where in the list to insert the element it . You basically navigate the list starting at head until you find the place where you insert it such that the list is in order. The result after inserting the object is that the list is always in order. The behavior described above is similar to some of the behavior of sorting algorithms. You would move a pointer in the list that marks where to insert the new element. Keep iterating while elements in the list are smaller than the element to be added. The comparison for order (smaller, larger, etc.) should be done with compareTo. Don't forget to increment count0fElements. Your Answer: Feedback
